NDLI: Next cache line and set prediction

Please wait, while we are loading the content...

The MIT Alewife machine: architecture and performance

The EM-X parallel computer: architecture and basic performance

The SPLASH-2 programs: characterization and methodological considerations

Efficient strategies for software-only protocols in shared-memory multiprocessors

Dynamic self-invalidation: reducing coherence overhead in shared-memory multiprocessors

Boosting the performance of hybrid snooping cache protocols

S-connect: from networks of workstations to supercomputer performance

Destage algorithms for disk arrays with non-volatile caches

Evaluating multi-port frame buffer designs for a mesh-connected multicomputer

Are crossbars really dead?: the case for optical multiprocessor interconnect systems

Exploring configurations of functional units in an out-of-order superscalar processor

Unconstrained speculative execution with predicated state buffering

A comparison of full and partial predicated execution support for ILP processors

Implementation trade-offs in using a restricted data flow architecture in a high performance RISC microprocessor

Performance evaluation of the PowerPC 620 microarchitecture

Reducing TLB and memory overhead using online superpage promotion

Speeding up irregular applications in shared-memory multiprocessors: memory binding and group prefetching

An efficient, fully adaptive deadlock recovery scheme: DISHA

Analysis and implementation of hybrid switching

Configurable flow control mechanisms for fault-tolerant routing

NIFDY: a low overhead, high throughput network interface

Vector multiprocessors with arbitrated memory access

Design of cache memories for multi-threaded dataflow architecture

Skewed associativity enhances performance predictability

A comparative analysis of schemes for correlated branch prediction

Next cache line and set prediction

A comparison of architectural support for messaging in the TMC CM-5 and the Cray T3D

Optimizing memory system performance for communication in parallel computers

Empirical evaluation of the CRAY-T3D: a compiler perspective

Optimization of instruction fetch mechanisms for high issue rates

Instruction fetching: coping with code bloat

Instruction cache fetch policies for speculative execution

Streamlining data cache access with fast address calculation

CAT—caching address tags: a technique for reducing area cost of on-chip caches

Simultaneous multithreading: maximizing on-chip parallelism

Architecture validation for processors

Multiscalar processors

Next cache line and set prediction

Content Provider	ACM Digital Library
Author	Calder, Brad Grunwald, Dirk
Abstract	Accurate instruction fetch and branch prediction is increasingly important on today's wide-issue architectures. Fetch prediction is the process of determining the next instruction to request from the memory subsystem. Branch prediction is the process of predicting the likely out-come of branch instructions. Several researchers have proposed very effective fetch and branch prediction mechanisms including branch target buffers (BTB) that store the target addresses of taken branches. An alternative approach fetches the instruction following a branch by using an index into the cache instead of a branch target address. We call such an index a next cache line and set (NLS) predictor. A NLS predictor is a pointer into the instruction cache, indicating the target instruction of a branch.In this paper we examine the use of NLS predictors for efficient and accurate fetch and branch prediction. Previous studies associated each NLS predictor with a cache line and provided only one-bit conditional branch predictors. Our study examines the use of NLS predictors with highly accurate two-level correlated conditional branch architectures. We examine the performance of decoupling the NLS predictors from the cache line and storing them in a separate tag-less memory buffer. Our results show that the decoupled architecture performs better than associating the NLS predictors with the cache line, that the NLS architecture benefits from reduced cache miss rates, and it is particularly effective for programs containing many branches. We also provide an in-depth comparison between the NLS and BTB architectures, showing that the NLS architecture is a competitive alternative to the BTB design.
Starting Page	287
Ending Page	296
Page Count	10
File Format	PDF
ISBN	0897916980
DOI	10.1145/223982.224439
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1995-07-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

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

Next Cache Line and Set Prediction (1995)

Next cache line and set prediction

Next Cache Line and Set Prediction (1995)

Reducing latencies of pipelined cache accesses through set prediction

Next cache line and set prediction

Reducing Latencies of Pipelined Cache Accesses Through Set Prediction

Path-based next trace prediction

Adaptive Line Size Cache (1999)

Simultaneous way-footprint prediction and branch prediction for ener gy savings in set-associative instruction caches (2001)

Next cache line and set prediction

Similar Documents

Next Cache Line and Set Prediction (1995)

Next cache line and set prediction

Next Cache Line and Set Prediction (1995)

Reducing latencies of pipelined cache accesses through set prediction

Next cache line and set prediction

Reducing Latencies of Pipelined Cache Accesses Through Set Prediction

Path-based next trace prediction

Adaptive Line Size Cache (1999)

Simultaneous way-footprint prediction and branch prediction for ener gy savings in set-associative instruction caches (2001)

Next cache line and set prediction