NDLI: Read-after-read memory dependence prediction

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

New microarchitecture challenges in the coming generations of CMOS process technologies (keynote address)(abstract only)

Control independence in trace processors

Fetch directed instruction prefetching

Improving branch predictors by correlating on data values

Instruction fetch mechanisms for multipath execution processors

A superscalar 3D graphics engine

Dynamic 3D graphics workload characterization and the architectural implications

Exploiting a new level of DLP in multimedia applications

Compiler-driven cached code compression schemes for embedded ILP processors

Evaluation of a high performance code compression method

Low-cost branch folding for embedded applications with small tight loops

Automatic and efficient evaluation of memory hierarchies for embedded systems

Hardware identification of cache conflict misses

Access region locality for high-bandwidth processor memory system design

Code transformations to improve memory parallelism

Compiler-directed dynamic computation reuse: rationale and initial results

Dynamic memory disambiguation in the presence of out-of-order store issuing

Read-after-read memory dependence prediction

Delaying physical register allocation through virtual-physical registers

Core technologies in hardware and software (invited speaker)(abstract only)

DIVA: a reliable substrate for deep submicron microarchitecture design

Exploiting ILP in page-based intelligent memory

The use of multithreading for exception handling

Value prediction for speculative multithreaded architectures

Predicting the usefulness of a block result: a micro-architectural technique for high-performance low-power processors

Selective cache ways: on-demand cache resource allocation

Wavefront scheduling: path based data representation and scheduling of subgraphs

Balance scheduling: weighting branch tradeoffs in superblocks

Optimizations and oracle parallelism with dynamic translation

Index of Authors

Read-after-read memory dependence prediction

Content Provider	ACM Digital Library
Author	Sohi, Gurindar S. Moshovos, Andreas
Abstract	We identify that typical programs exhibit highly regular read-after-read (RAR) memory dependence streams. We exploit this regularity by introducing read-after-read (RAR) memory dependence prediction. We also present two RAR memory dependence prediction-based memory latency reduction techniques. In the first technique, a load can obtain a value by simply naming a preceding load with which a RAR dependence is predicted. The second technique speculatively converts a series of LOADI-USEI,…,LOADN-USEN chains into a single LOADI-USEI…USEN producer/consumer graph. Our techniques can be implemented as surgical extensions to the recently proposed read-after-write (RAW) dependence prediction based speculative memory cloaking and speculative memory bypassing. On average, our techniques provide correct values for an additional 20% (integer codes) and 30% (floating-point codes) of all loads. Moreover, a combined RAW- and RAR-based cloaking/bypassing mechanism improves performance by 6.44% (integer) and 4.66% (floating-point) even when naive memory dependence speculation is used. The original RAW-based cloaking/bypassing mechanism yields improvements of 4.28% (integer) and 3.20% (floating-point).
Starting Page	177
Ending Page	185
Page Count	9
File Format	PDF
ISBN	076950437X
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1999-11-16
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

Read-after-read memory dependence prediction

Memory dependence prediction in multimedia applications.

Reducing memory latency via read-after-read memory dependence prediction

Store vectors for scalable memory dependence prediction and scheduling

Memory dependence prediction using store sets

Memory dependence prediction using store sets

Counting Dependence Predictors

Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets

Dynamic data dependence tracking and its application to branch prediction

Read-after-read memory dependence prediction

Similar Documents

Read-after-read memory dependence prediction

Memory dependence prediction in multimedia applications.

Reducing memory latency via read-after-read memory dependence prediction

Store vectors for scalable memory dependence prediction and scheduling

Memory dependence prediction using store sets

Memory dependence prediction using store sets

Counting Dependence Predictors

Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets

Dynamic data dependence tracking and its application to branch prediction

Read-after-read memory dependence prediction