Streamlining Inter-operation Memory Communication via Data Dependence Prediction

DMCA

Streamlining Inter-operation Memory Communication via Data Dependence Prediction (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Andreas Moshovos , Gurindar S. Sohi

Venue:	In Proceedings of the 30th International Symposium on Microarchitecture
Citations:	97 - 0 self

BibTeX

@INPROCEEDINGS{Moshovos97streamlininginter-operation,
    author = {Andreas Moshovos and Gurindar S. Sohi},
    title = {Streamlining Inter-operation Memory Communication via Data Dependence Prediction},
    booktitle = {In Proceedings of the 30th International Symposium on Microarchitecture},
    year = {1997}
}

OpenURL

Abstract

We revisit memory hierarchy design viewing memory as an inter-operation communication agent. This perspective leads to the development of novel methods of performing inter-operation memory communication: (1) We use data dependence prediction to identify and link dependent loads and stores so that they can communicate speculatively without incurring the overhead of address calculation, disambiguation and data cache access. (2) We also use data dependence prediction to convert, DEFstore-load-USE chains within the instruction window into DEF-USE chains prior to address calculation and disambiguation. (3) We use true and output data dependence status prediction to introduce and manage a small storage structure called the Transient Value Cache (TVC). The TVC captures memory values that are short-lived. It also captures recently stored values that are likely to be accessed soon. Accesses that are serviced by the TVC do not have to be serviced by other parts of the memory hierarchy, e.g., the data cache. The first two techniques are aimed at reducing the effective communication latency whereas the last technique is aimed at reducing data cache bandwidth requirements. Experimental analysis of the proposed techniques shows that: (i) the proposed speculative communication methods correctly handle a large fraction of memory dependences, and (ii) a large number of the loads and stores do not have to ever reach the data cache when the TVC is in place. 1

Keyphrases

data dependence prediction inter-operation memory communication data cache memory dependence memory value speculative communication method large number data cache bandwidth requirement effective communication latency address calculation instruction window last technique large fraction data cache access memory hierarchy small storage structure memory hierarchy design inter-operation communication agent transient value cache dependent load novel method output data dependence status prediction defstore-load-use chain def-use chain experimental analysis

DMCA