{"updated":"2025-01-22T22:55:29.256682+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00018193","sets":["934:1119:1120:1123"]},"path":["1123"],"owner":"1","recid":"18193","title":["CPBP：実行パス履歴を有効に利用する低コスト高精度パーセプトロン分岐予測器"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-06-26"},"_buckets":{"deposit":"e8aa1383-0e77-4e62-b255-39eb6cde971d"},"_deposit":{"id":"18193","pid":{"type":"depid","value":"18193","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"CPBP：実行パス履歴を有効に利用する低コスト高精度パーセプトロン分岐予測器","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"CPBP：実行パス履歴を有効に利用する低コスト高精度パーセプトロン分岐予測器"},{"subitem_title":"CPBP: A Low-Cost Highly-Accurate Perceptron Branch Predictor with Effective Use of Execution Path History","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"プロセッサアーキテクチャ","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2008-06-26","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学情報工学科"},{"subitem_text_value":"電気通信大学情報工学科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro-Communications","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/18193/files/IPSJ-TACS0101011.pdf"},"date":[{"dateType":"Available","dateValue":"2010-06-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS0101011.pdf","filesize":[{"value":"549.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"18a7523a-f46c-4ea5-9416-ced133c04b47","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"二ノ宮, 康之"},{"creatorName":"阿部, 公輝"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuyuki, Ninomiya","creatorNameLang":"en"},{"creatorName":"Kôki, Abe","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11833852","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7829","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"パーセプトロン分岐予測器は高い予測精度を示すが，構造が複雑で実装コストが大きいという欠点を持つ．これは多数の重みを利用することに起因する．本稿では新しいパーセプトロン分岐予測器を提案する．これは，(1) 1つの分岐命令の予測に使用する重みの数を減らすことにより実装コストを削減し，(2) 詳細な実行パス履歴とグローバル履歴の一部をインデックスに利用することにより予測精度を向上させる．使用できる記憶容量を一定とすると，本手法により従来法より低い実装コストで高い予測精度を持つパーセプトロン分岐予測器が実現できる．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Perceptron branch predictors have been extensively studied in recent years in an attempt to reduce misprediction rates. However, it has the disadvantage that the implementation cost is high due to its complex structure. The complexity comes from a large number of weight tables they use. In this paper, we propose a new perceptron branch predictor that reduces the cost by reducing the number of weight tables, and increases the prediction rates by using detailed execution path history and part of global history as the index of weight tables. Given a constant amount of storage available, the proposed scheme enables to increase the prediction accuracy with less implementation costs compared to previous perceptron predictors.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"104","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicPageStart":"96","bibliographicIssueDates":{"bibliographicIssueDate":"2008-06-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"1"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:50:59.474234+00:00","id":18193,"links":{}}