{"links":{},"id":18260,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00018260","sets":["934:1119:1126:1129"]},"path":["1129"],"owner":"1","recid":"18260","title":["An Efficient Analysis of Worst Case Flush Timings for Branch Predictors"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-05-15"},"_buckets":{"deposit":"db71841a-d5e2-4fdb-801e-5595effedcf9"},"_deposit":{"id":"18260","pid":{"type":"depid","value":"18260","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"An Efficient Analysis of Worst Case Flush Timings for Branch Predictors","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An Efficient Analysis of Worst Case Flush Timings for Branch Predictors"},{"subitem_title":"An Efficient Analysis of Worst Case Flush Timings for Branch Predictors","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"プロセッサアーキテクチャ","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2007-05-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Toyohashi University of Technology"},{"subitem_text_value":"Nara Institute of Science and Technology"},{"subitem_text_value":"Nagoya Institute of Technology"},{"subitem_text_value":"Kyoto University"},{"subitem_text_value":"Nagoya University   Presently with PFU Ltd."}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Toyohashi University of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nara Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Nagoya University , Presently with PFU Ltd.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/18260/files/IPSJ-TACS4808014.pdf"},"date":[{"dateType":"Available","dateValue":"2009-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS4808014.pdf","filesize":[{"value":"521.0 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":"ee629326-5b56-445a-9c61-166d20ec07e9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masahiro, Konishi"},{"creatorName":"Takashi, Nakada"},{"creatorName":"Tomoaki, Tsumura"},{"creatorName":"Hiroshi, Nakashima"},{"creatorName":"Hiroaki, Takada"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masahiro, Konishi","creatorNameLang":"en"},{"creatorName":"Takashi, Nakada","creatorNameLang":"en"},{"creatorName":"Tomoaki, Tsumura","creatorNameLang":"en"},{"creatorName":"Hiroshi, Nakashima","creatorNameLang":"en"},{"creatorName":"Hiroaki, Takada","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":"This paper proposes an efficient algorithm to find the worst case flush timings for a given program with respect to the number of branch mispredictions. We first give a basic algorithm based on dynamic programming which takes O(N^2F) computation time for a program with N conditional branches and F flush timings. We then show it can be improved to achieve a computation time of approximately O(NF) for practical programs with its proof obtained through an evaluation with SPEC CPU95 benchmarks.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper proposes an efficient algorithm to find the worst case flush timings for a given program with respect to the number of branch mispredictions. We first give a basic algorithm based on dynamic programming which takes O(N^2F) computation time for a program with N conditional branches and F flush timings. We then show it can be improved to achieve a computation time of approximately O(NF) for practical programs with its proof obtained through an evaluation with SPEC CPU95 benchmarks.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"140","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicPageStart":"127","bibliographicIssueDates":{"bibliographicIssueDate":"2007-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG8(ACS18)","bibliographicVolumeNumber":"48"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:51:02.476384+00:00","updated":"2025-01-22T22:52:55.965935+00:00"}