DOC PREVIEW
Berkeley COMPSCI 252 - Exploiting Criticality to Reduce Branch Misprediction Penalties

This preview shows page 1-2-3 out of 8 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Exploiting Criticality to Reduce Branch Misprediction PenaltiesCriticality RevisitedCritical D ChainsEffect of branch misprediction penalty in default configurationCorrelation....?How to best spend your CacheHow does the new cache fare?What if...Exploiting Criticality to Reduce Branch Misprediction PenaltiesTim Lee and Jim ChenFall CS252John KubiatowiczCriticality RevisitedD0E0C0D1E1C1D2E2C2D3E3C3Critical D Chains01020304050607080AnagramGccPerlEonAmmpArtCraftyTwolfBzipMesaAverage D Chain LengthEffect of branch misprediction penalty in default configuration0.000 10.000 20.000 30.000 40.000 50.0000.4000.4500.5000.5500.6000.6500.7000.7500.8000.8500.9000.9501.000Sensitivity of CPI to Miss PenaltyAnagramGccPerlMiss PenaltyNormalized CPICorrelation....?0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1020406080100120140160180200Branch Accuracy vs Average Critical Chain LengthBranch AccuracyAverage LengthHow to best spend your Cache●A common way of spending transistors is to make caches bigger●Lets try a new cache to be used on branch mispredicts●Small, fully associative trace cache●Simulated 5 entry buffer had gains between 5-20%How does the new cache fare?Anagram Gcc Perl00.20.40.60.811.21.41.61.82Comparison of new cache vs increased l1 cache sizeBaseDoubleL15 Entry CacheCPI (lower is better)What if...●SMT/Multi-path execution●Really aggressive ca$hing●In-order <=> out of order●Long pipeline <=> short pipeline●Reconfigurable


View Full Document

Berkeley COMPSCI 252 - Exploiting Criticality to Reduce Branch Misprediction Penalties

Documents in this Course
Quiz

Quiz

9 pages

Caches I

Caches I

46 pages

Lecture 6

Lecture 6

36 pages

Lecture 9

Lecture 9

52 pages

Figures

Figures

26 pages

Midterm

Midterm

15 pages

Midterm

Midterm

14 pages

Midterm I

Midterm I

15 pages

ECHO

ECHO

25 pages

Quiz  1

Quiz 1

12 pages

Load more
Download Exploiting Criticality to Reduce Branch Misprediction Penalties
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Exploiting Criticality to Reduce Branch Misprediction Penalties and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Exploiting Criticality to Reduce Branch Misprediction Penalties 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?