Thumbnail
Access Restriction
Subscribed

Author Vintan, L.N. ♦ Egan, C.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1999
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword History ♦ Postal services ♦ Pipelines ♦ Accuracy ♦ Read only memory ♦ Electronic switching systems ♦ Predictive models ♦ Radio access networks ♦ Performance loss ♦ Availability
Abstract The main aim of this research is to propose a new Two-Level Adaptive Branch Prediction scheme, based on additional correlation information. Conventional two-level adaptive branch prediction exploits the correlation between the outcome of a branch and the path followed through a program to reach the branch. Typically the program path is identified by recording whether each branch on the path is taken or nor taken. Unfortunately, this limited information is insufficient to allow one path to a branch to be distinguished from other potential paths to the same branch. In this paper, we explore the benefits of adding sufficient information, in the form of successive branch addresses, to uniquely identify each program path. We use trace-driven simulation to compare our modified branch prediction scheme with a conventional GAp two-level predictor and demonstrate that our new predictor performs better than the conventional GAp scheme at the same level of hardware complexity,.
Description Author affiliation: Dept. of Comput. Sci., L. Blaga Univ., Romania (Vintan, L.N.)
ISBN 0769503217
ISSN 10896503
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1999-09-08
Publisher Place Italy
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 53.72 kB
Page Count 8
Starting Page 441
Ending Page 448


Source: IEEE Xplore Digital Library