分支预测器最坏情况刷新时间的有效分析

Ipsj Digital Courier Pub Date : 2007-05-15 DOI:10.2197/IPSJDC.3.255

Masahiro Konishi, Takashi Nakada, Tomoaki Tsumura, H. Nakashima, H. Takada

{"title":"分支预测器最坏情况刷新时间的有效分析","authors":"Masahiro Konishi, Takashi Nakada, Tomoaki Tsumura, H. Nakashima, H. Takada","doi":"10.2197/IPSJDC.3.255","DOIUrl":null,"url":null,"abstract":"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(N2F) computation time for a program with Nconditional 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.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"161 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Efficient Analysis of Worst Case Flush Timings for Branch Predictors\",\"authors\":\"Masahiro Konishi, Takashi Nakada, Tomoaki Tsumura, H. Nakashima, H. Takada\",\"doi\":\"10.2197/IPSJDC.3.255\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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(N2F) computation time for a program with Nconditional 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.\",\"PeriodicalId\":432390,\"journal\":{\"name\":\"Ipsj Digital Courier\",\"volume\":\"161 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ipsj Digital Courier\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2197/IPSJDC.3.255\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ipsj Digital Courier","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2197/IPSJDC.3.255","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种有效的算法，可以根据分支错误预测的数量找到给定程序的最坏情况刷新时间。首先给出了一个基于动态规划的基本算法，该算法对一个具有非条件分支和F次刷新时间的程序计算时间为O(N2F)。然后，通过对SPEC CPU95基准测试的评估，我们证明了它可以改进到实际程序的计算时间约为0 (NF)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Efficient Analysis of Worst Case Flush Timings for Branch Predictors

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(N2F) computation time for a program with Nconditional 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Ipsj Digital Courier

自引率

0.00%

发文量