Computer system branch prediction of subroutine returns
作者： James Eickemeyer
DOI:
关键词: Branch target predictor 、 Parallel computing 、 State (computer science) 、 Branch 、 Indirect branch 、 TRACE (psycholinguistics) 、 Subroutine 、 Branch predictor 、 Computer science 、 Speculative execution
摘要: Described is a branch unit that predicts instruction target addresses. The prediction improved by using Call-Return Stack to predict subroutine routine branches. mechanism designed for high-performance processors where call and return instructions may overlap in execution or be issued speculatively. maintains the state known trace tracks speculative traces.
lens.org 参考文章(11)
Hanan Potash, Branch predicting computer ,(1982)
James E. Smith, Branch predictor using random access memory ,(1980)
Kouemon Nigo, Ritsuo Sugaya, Masanobu Akagi, Syuichi Hanatani, Toshiteru Shibuya, Instruction prefetching device with prediction of a branch destination address ,(1983)
Toyohiko Yoshida, Masahito Matsuo, Preceding instruction address based branch prediction in a pipelined processor ,(1988)
Howard E. Sachar, James H. Pomerene, Frank J. Sparacio, Rudolph N. Rechtschaffen, Gururaj S. Rao, Philip G. Emma, Branch prediction mechanism in which a branch history table is updated using an operand sensitive branch table ,(1985)
Walstein B. Smith, Korbin Van Dyke, John G. Favor, David R. Stiles, Integrated single structure branch prediction cache ,(1991)
Neil J. Johnson, Steven Schwartz, Suren Irukulla, Robert F. Beckwith, Nihar Mohapatra, High-performance pipelined central processor for predicting the occurrence of executing single-cycle instructions and multicycle instructions ,(1988)
David R. Stiles, Korbin S. Van Dyke, John G. Favor, Two-level branch prediction cache ,(1992)
Katsumi Onishi, Yuto Ono, Branching control system ,(1984)