Skip to main content
Article
Dynamic Memory Disambiguation Using the Memory Conflict Buffer
Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems
  • David M. Gallagher, Cedarville University
  • W. Y. Chen
  • S. A. Mahlke
  • J. C. Gyllenhaal
  • W. W. Hwu
Document Type
Conference Proceeding
Publication Date
10-1-1994
DOI
10.1145/195470.195534
Abstract
To exploit instruction level parallelism, compilers for VLIW and superscalar processors often employ static code scheduling. However, the available code reordering may be severely restricted due to ambiguous dependences between memory instructions. This paper introduces a simple hardware mechanism, referred to as the memory conflict buffer, which facilitates static code scheduling in the presence of memory store/load dependences. Correct program execution is ensured by the memory conflict buffer and repair code provided by the compiler. With this addition, significant speedup over an aggressive code scheduling model can be achieved for both non-numerical and numerical programs.
Citation Information
David M. Gallagher, W. Y. Chen, S. A. Mahlke, J. C. Gyllenhaal, et al.. "Dynamic Memory Disambiguation Using the Memory Conflict Buffer" Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems Vol. 29 Iss. 11 (1994) p. 183 - 193
Available at: http://works.bepress.com/david-gallagher/10/