Show simple item record

dc.contributor.authorVintan, L.
dc.contributor.authorEgan, C.
dc.date.accessioned2011-11-28T16:01:09Z
dc.date.available2011-11-28T16:01:09Z
dc.date.issued1999
dc.identifier.citationVintan , L & Egan , C 1999 , Extending correlation in branch prediction schemes . in Procs of 25th EUROMICRO Conf . vol. 1 , IEEE , pp. 441-448 . DOI: 10.1109/EURMIC.1999.794506
dc.identifier.isbn0-7695-0321-7
dc.identifier.otherPURE: 462247
dc.identifier.otherPURE UUID: 262fda47-1318-4229-a68f-4eeee48841c9
dc.identifier.otherdspace: 2299/1581
dc.identifier.otherScopus: 0009014261
dc.identifier.urihttp://hdl.handle.net/2299/7160
dc.descriptionThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.---- Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. DOI : 10.1109/EURMIC.1999.794506
dc.description.abstractThe 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 not 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.en
dc.language.isoeng
dc.publisherIEEE
dc.relation.ispartofProcs of 25th EUROMICRO Conf
dc.rights/dk/atira/pure/core/openaccesspermission/open
dc.titleExtending correlation in branch prediction schemesen
dc.contributor.institutionSchool of Computer Science
dc.relation.schoolSchool of Computer Science
dc.description.versiontypeFinal Accepted Version
rioxxterms.versionAM
rioxxterms.versionofrecordhttps://doi.org/10.1109/EURMIC.1999.794506
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record