2011Computer Engineering and ScienceRequires access

Pshare:A Two-Level Adaptive Branch Predictor Algorithm and Its Implementation

Qiang Li

Open publisher page 0 citations

Abstract

A branch prediction algorithm and predictor called Pshare is proposed,which has the benefit of PAs and the Gshare predictor,and modifies their flaws due to using a global history pattern by using a separate branch history shift register(BHSR).Moreover it also can reduce the area and delay overhead than PAs by accessing a small PHT table using the hash of address and history patterns instead of accessing two dimensions PHT table using the address and history patterns.The Pshare predictor can obtain the branch prediction accuracy of PAs,but the implementation overhead is near to Gshare.This predictor is applied to high performance processors which have a superscalar deep pipeline and focuses more on higher core performance.It reduces the pipeline's vertical waste and improves the core performance and efficiency by using the Pshare predictor.

About this research paper

What this paper is about

A branch prediction algorithm and predictor called Pshare is proposed,which has the benefit of PAs and the Gshare predictor,and modifies their flaws due to using a global history pattern by using a separate branch history shift register(BHSR).Moreover it also can reduce the area and delay overhead than PAs by accessing a small PHT table using the hash of address and history patterns instead of accessing two dimensions PHT table using the address and history patterns.The Pshare predictor can obtain the branch prediction accuracy of PAs,but the implementation overhead is near to Gshare.This predictor is applied to high performance processors which have a superscalar deep pipeline and focuses more on higher core performance.It reduces the pipeline's vertical waste and improves the core performance and efficiency by using the Pshare predictor.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A branch prediction algorithm and predictor called Pshare is proposed,which has the benefit of PAs and the Gshare predictor,and modifies their flaws due to using a global history pattern by using a separate branch history shift register(BHSR).Moreover it also can reduce the area and delay overhead than PAs by accessing a small PHT table using the hash of address and history patterns instead of accessing two dimensions PHT table using the address and history patterns.The Pshare predictor can obtain the branch prediction accuracy of PAs,but the implementation overhead is near to Gshare.This predictor is applied to high performance processors which have a superscalar deep pipeline and focuses more on higher core performance.It reduces the pipeline's vertical waste and improves the core performance and efficiency by using the Pshare predictor.

Key concepts: Branch predictor, Computer science, Pipeline (software), Superscalar, Overhead (engineering), Parallel computing, Microarchitecture, Hash function

Related papers

Back to paper searchBrowse research topicsOriginal source
Pshare:A Two-Level Adaptive Branch Predictor Algorithm and Its Implementation — Research Paper | ScholarLens