Description: Accurate branch-prediction is necessary to utilize deeply pipelined and Very Long Instruction-Word (VLIW) architectures. For a set of program traces we show the upper limits on branch predictability, and hence machine utilization, for important classes of branch-predictors using static (compiletime) and dynamic (runtime) program information. A set of optimal superpredictors'' is derived from these program traces. These optimal predictors compare favorably with other proposed methods of branch-prediction. 3 refs., 5 figs., 12 tabs.
Date: September 11, 1990
Creator: Ponder, C.G. (Lawrence Livermore National Lab., CA (USA)) & Shebanow, M.C. (Motorola, Inc., Austin, TX (USA))
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department