NDLI: Looking at history to filter allocations in prediction tables

Content Provider	IEEE Xplore Digital Library
Author	Morancho, E. Liaberia, J.M. Olive, A.
Copyright Year	1999
Description	Author affiliation: Dept. d'Arquitectura de Computadors, Univ. Politecnica de Catalunya, Barcelona, Spain (Morancho, E.)
Abstract	Dependencies between instructions impose an execution order that must be preserved to guarantee the semantic correctness of programs. Recent works propose the use of prediction techniques to speculatively execute dependent operations, showing a significant increment in IPC. We propose a mechanism that reduces the area cost of a typical address predictor: the last-address predictor. Our proposal classifies load instructions at run-time and records the classifications in a table with more entries than the prediction table. Moreover, it uses this information to initialize its confidence information and to filter the allocation of the load instructions in the prediction table. Using direct mapped tables, our proposal captures a similar predictability and increases the accuracy of the typical address predictor and represents around a 40% area-cost saving.
Starting Page	314
Ending Page	319
File Size	77879
Page Count	6
File Format	PDF
ISBN	0769504256
ISSN	1089795X
DOI	10.1109/PACT.1999.807577
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-10-12
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	History Computer aided instruction Proposals Counting circuits Electronic switching systems Predictive models Costs Information filtering Information filters Parallel processing
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Hardware and Architecture 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

Comparison of branch prediction schemes for superscalar processors ICEEC 2004

Perceptron learning for predicting the behavior of conditional branches

A scalable parallel computational core for embedded processing

MBF: a Real Matrix Bloom Filter Representation Method on Dynamic Set

A Cache Architecture for Counting Bloom Filters

ALFA: a static data flow architecture

EPIC: Explicitly Parallel Instruction Computing

A High-Speed ``Compare'' Circuit

Multi-core and SIMD architecture based implementation of recursive digital filtering algorithms

Looking at history to filter allocations in prediction tables

Similar Documents

Comparison of branch prediction schemes for superscalar processors ICEEC 2004

Perceptron learning for predicting the behavior of conditional branches

A scalable parallel computational core for embedded processing

MBF: a Real Matrix Bloom Filter Representation Method on Dynamic Set

A Cache Architecture for Counting Bloom Filters

ALFA: a static data flow architecture

EPIC: Explicitly Parallel Instruction Computing

A High-Speed ``Compare'' Circuit

Multi-core and SIMD architecture based implementation of recursive digital filtering algorithms

Looking at history to filter allocations in prediction tables