Split history tables for branch prediction

作者: Terry Parks , G. Glenn Henry

DOI:

关键词: Outcome (probability)Branch tableAlgorithmFunction (mathematics)StatisticsBranch target predictorBranch predictorIndirect branchComputer sciencePipeline (computing)Branch

摘要: An apparatus and method are provided for accurately predicting the outcome of branch instructions prior to their execution by a pipeline microprocessor. The includes bias indicator dynamic predictor. receives instruction from an buffer provides output indicating particular category instruction. as function type displacement, where displacement prescribed predictor is coupled indicator. predicts based upon contents entry in history table, table corresponds category, maintains plurality tables, each tables corresponding selected categories, categories comprises taken not category.

参考文章(36)
Thomas R. Puzak, James R. Robinson, Joshua W. Knight, Philip G. Emma, A. James Van Norstrand, Computer processing unit employing a separate millicode branch history table ,(1995)
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)
Joseph I. Chamdani, Cecil O. Alford, Apparatus and method for improving superscalar processors ,(1997)
James Herbert Pomerene, Frank John Sparacio, Rudolph Nathan Rechtschaffen, Thomas Roberts Puzak, Philip Lewis Rosenfeld, Pageable branch history table ,(1986)
James H. Pomerene, Frank J. Sparacio, Rudolph N. Rechtschaffen, Joshua W. Knight, Philip G. Emma, Methods and apparatus for insulating a branch prediction mechanism from data dependent branch table updates that result from variable test operand locations ,(1989)