@article{oai:ipsj.ixsq.nii.ac.jp:00018260,
 author = {Masahiro, Konishi and Takashi, Nakada and Tomoaki, Tsumura and Hiroshi, Nakashima and Hiroaki, Takada and Masahiro, Konishi and Takashi, Nakada and Tomoaki, Tsumura and Hiroshi, Nakashima and Hiroaki, Takada},
 issue = {SIG8(ACS18)},
 journal = {情報処理学会論文誌コンピューティングシステム（ACS）},
 month = {May},
 note = {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., 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.},
 pages = {127--140},
 title = {An Efficient Analysis of Worst Case Flush Timings for Branch Predictors},
 volume = {48},
 year = {2007}
}