WEKO3
アイテム
An Efficient Analysis of Worst Case Flush Timings for Branch Predictors
https://ipsj.ixsq.nii.ac.jp/records/18260
https://ipsj.ixsq.nii.ac.jp/records/182608b220a80-50dd-4eac-bd1c-f15d1a9336c7
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TACS4808014.pdf (521.0 kB)
|
Copyright (c) 2007 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2007-05-15 | |||||||
| タイトル | ||||||||
| タイトル | An Efficient Analysis of Worst Case Flush Timings for Branch Predictors | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | An Efficient Analysis of Worst Case Flush Timings for Branch Predictors | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | プロセッサアーキテクチャ | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Toyohashi University of Technology | ||||||||
| 著者所属 | ||||||||
| Nara Institute of Science and Technology | ||||||||
| 著者所属 | ||||||||
| Nagoya Institute of Technology | ||||||||
| 著者所属 | ||||||||
| Kyoto University | ||||||||
| 著者所属 | ||||||||
| Nagoya University Presently with PFU Ltd. | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Toyohashi University of Technology | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Nara Institute of Science and Technology | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Nagoya Institute of Technology | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Nagoya University , Presently with PFU Ltd. | ||||||||
| 著者名 |
Masahiro, Konishi
Takashi, Nakada
Tomoaki, Tsumura
Hiroshi, Nakashima
Hiroaki, Takada
× Masahiro, Konishi Takashi, Nakada Tomoaki, Tsumura Hiroshi, Nakashima Hiroaki, Takada
|
|||||||
| 著者名(英) |
Masahiro, Konishi
Takashi, Nakada
Tomoaki, Tsumura
Hiroshi, Nakashima
Hiroaki, Takada
× Masahiro, Konishi Takashi, Nakada Tomoaki, Tsumura Hiroshi, Nakashima Hiroaki, Takada
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA11833852 | |||||||
| 書誌情報 |
情報処理学会論文誌コンピューティングシステム（ACS） 巻 48, 号 SIG8(ACS18), p. 127-140, 発行日 2007-05-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7829 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
