NDLI: Analysis of branch prediction via data compression (SIGP, Vol. 31, Issue. 9)

Content Provider	ACM Digital Library
Author	Chen, I-Cheng K. Coffey, John T. Mudge, Trevor N.
Abstract	Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, very few studies address the theoretical basis behind these prediction schemes. Knowing this theoretical basis helps us to evaluate how good a prediction scheme is and how much we can expect to improve its accuracy.In this paper, we apply techniques from data compression to establish a theoretical basis for branch prediction, and to illustrate alternatives for further improvement. To establish a theoretical basis, we first introduce a conceptual model to characterize each component in a branch prediction process. Then we show that current "two-level" or correlation based predictors are, in fact, simplifications of an optimal predictor in data compression, Prediction by Partial Matching (PPM).If the information provided to the predictor remains the same, it is unlikely that significant improvements can be expected (asymptotically) from two-level predictors, since PPM is optimal. However, there are a rich set of predictors available from data compression, several of which can still yield some improvement in cases where resources are limited. To illustrate this, we conduct trace-driven simulation running the Instruction Benchmark Suite and the SPEC CINT95 benchmarks. The results show that PPM can outperform a two-level predictor for modest sized branch target buffers.
Starting Page	128
Ending Page	137
Page Count	10
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/248209.237171
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	31
Issue Number	9
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multiple-block ahead branch predictors (SIGP, Vol. 31, Issue. 9)

Value locality and load value prediction (SIGP, Vol. 31, Issue. 9)

Petal:distributed virtual disks (SIGP, Vol. 31, Issue. 9)

Compiler-based prefetching for recursive data structures (SIGP, Vol. 31, Issue. 9)

A quantitative analysis of loop nest locality (SIGP, Vol. 31, Issue. 9)

Thread scheduling for cache locality (SIGP, Vol. 31, Issue. 9)

The structure and performance of interpreters (SIGP, Vol. 31, Issue. 9)

Improving cache performance with balanced tag and data paths (SIGP, Vol. 31, Issue. 9)

Exploiting dual data-memory banks in digital signal processors (SIGP, Vol. 31, Issue. 9)

Analysis of branch prediction via data compression (SIGP, Vol. 31, Issue. 9)

Similar Documents

Multiple-block ahead branch predictors (SIGP, Vol. 31, Issue. 9)

Value locality and load value prediction (SIGP, Vol. 31, Issue. 9)

Petal:distributed virtual disks (SIGP, Vol. 31, Issue. 9)

Compiler-based prefetching for recursive data structures (SIGP, Vol. 31, Issue. 9)

A quantitative analysis of loop nest locality (SIGP, Vol. 31, Issue. 9)

Thread scheduling for cache locality (SIGP, Vol. 31, Issue. 9)

The structure and performance of interpreters (SIGP, Vol. 31, Issue. 9)

Improving cache performance with balanced tag and data paths (SIGP, Vol. 31, Issue. 9)

Exploiting dual data-memory banks in digital signal processors (SIGP, Vol. 31, Issue. 9)

Analysis of branch prediction via data compression (SIGP, Vol. 31, Issue. 9)