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

IEEE Transactions on Computers

Volumn 51, Issue 3, 2002, Pages 313-326

  Moshovos, Andreas ^a   Sohi, Gurindar S ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b University of Wisconsin   (United States)

Author keywords

Cache; Dynamic optimization; Load; Memory dependence prediction

Indexed keywords

CODES (SYMBOLS); DATA HANDLING; GRAPH THEORY; OPTIMIZATION; PROBABILITY; SCHEDULING;

FLOATING POINT CODES; MEMORY DEPENDENCE PREDICTION; READ-AFTER-READ MEMORY;

CACHE MEMORY;

EID: 0036523327     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.990129     Document Type: Article

References (32)

1. T.M. Austin, D.N. Pnevmatikatos, and G.S. Sohi, "Fast Address Calculation," Proc. 22nd Int'l Symp. Computer Architecture, June 1995.
2. T.M. Austin and G.S. Sohi, "Zero-Cycle Loads: Microarchitecture Support for Reducing Load Latency," Proc. 28th Ann. Int'l Symp. Microarchitecture, Nov. 1995.
3. J.-L. Baer and T.-F. Chen, "An Effective On-Chip Preloading Scheme to Reduce Data Access Penalty," Proc. Int'l Conf. Supercomputing, 1991.
4. M. Bekerman, S. Jourdan, R. Ronen, G. Kirshenboim, L. Rappoport, A. Yoaz, and U. Weiser, "Correlated Load-Address Predictors," Proc. 26th Int'l Symp. Computer Architecture, May 1999.
5. S.E. Breach, "Design and Evaluation of a Multiscalar Processor," PhD thesis, Univ. Wisconsin-Madison, Dec. 1998.
6. B. Calder, G. Reinman, and D. Tullsen, "Selective Value Prediction," Proc. 26th Int'l Symp. Computer Architecture, May 1999.
7. B.-C. Cheng, D.A. Connors, and W.-M. Hwu, "Compiler-Directed Early Load-Address Generation," Proc. 31st Ann. Int'l Symp. Microarchitecture, Dec. 1998.
8. G.Z. Chrysos, and J.S. Emer, "Memory Dependence Prediction Using Store Sets," Proc. 25th Int'l Symp. Computer Architecture, June 1998.
9. R.J. Eickemeyer and S. Vassiliadis, "A Load-Instruction Unit for Pipelined Processors," IBM J. Research and Development, vol. 37, no. 4, July 1993.
10. F. Gabbay and A. Medelson, "Speculative Execution Based on Value Prediction," Technical Report, TR-1080, Electrical Eng. Dept., Technion-Israel Inst. of Technology, Nov. 1996.
11. M. Golden and T. Mudge, "Hardware Support for Hiding Cache Latency," Technical Report CSE-TR-152-93, Dept. of Electrical Eng. and Computer Science, Univ. of Michigan, Feb. 1991.
12. S. Jourdan, R. Ronen, M. Bekerman, B. Shomar, and A. Yoaz, "A Novel Renaming Scheme to Exploit Value Temporal Locality through Physical Register Reuse and Unification," Proc. 31st Ann. Int'l Symp. Microarchitecture, Dec. 1998.
13. G. Kane, MIPS R2000/R300 RISC Architecture. Prentice Hall, 1987.
14. S.M. Kurlander and C.N. Fischer, "Minimum Cost Interprocedural Register Allocation," Proc. 23rd ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, Jan. 1996.
15. J. Gonzalez and A. Gonzalez, "Speculative Execution via Address Prediction and Data Prefetching," Proc. Int'l Conf. Supercomputing, July 1997.
16. M.H. Lipasti, "Value Locality and Speculative Execution," PhD thesis, Carnegie Mellon Univ., Apr. 1997.
17. M.H. Lipasti and J.P. Shen, "Exceeding the Dataflow Limit via Value Prediction," Proc. 29th Ann. Int'l Symp. Microarchitecture, Dec. 1996.
18. M.H. Lipasti, C.B. Wilkerson, and J.P. Shen, "Value Locality and Load Value Prediction," Proc. Seventh Ann. Symp. Architectural Support for Languages and Operating Systems, Oct. 1996.
19. S. McFarling, "Combining Branch Predictors," Technical Report TN-36, Digital Equipment Corp., Western Research Laboratory, June 1993.
20. A. Moshovos, "Memory Dependence Prediction," PhD thesis, Univ. of Wisconsin-Madison, Dec. 1998.
21. A. Moshovos, S. Breach, T. Vijaykumar, and G. Sohi, "Dynamic Speculation and Synchronization of Data Dependences," Proc. 24th Int'l Symp. Computer Architecture, June 1997.
22. A. Moshovos and G. Sohi, "Streamlining Inter-Operation Communication via Data Dependence Prediction," Proc. 30th Ann. Int'l Symp. Microarchitecture, Dec. 1997.
23. M. Reilly and J. Edmondson, "Performance Simulation of an Alpha Microprocessor," Computer, vol. 31, no. 5, May 1998.
24. G. Reinman and B. Calder, "Predictive Techniques for Aggressive Load Speculation," Proc. 31st Ann. Int'l Symp. Microarchitecture, Dec. 1998.
25. G. Reinman, B. Calder, D. Tullsen, G. Tyson, and T. Austin, "Profile Guided Load Marking for Memory Renaming," Technical Report CS98-593, Univ. of California, San Diego, July 1998.
26. E. Rotenberg, Q. Jacobson, Y. Sazeides, and J. Smith, "Trace Processors," Proc. 30th Ann. Int'l Symp. Microarchitecture, Dec. 1997.
27. Y. Sazeides and J.E. Smith, "The Predictability of Data Values," Proc. Ann. Int'l Symp. Microarchitecture-30, Dec. 1997.
28. A. Sodani and G.S. Sohi, "Understanding the Differences Between Value Prediction and Instruction Reuse," Proc. 31st Ann. Int'l Symp. Microarchitecture, Dec. 1998.
29. G.S. Tyson and T.M. Austin, "Improving the Accuracy and Performance of Memory Communication through Renaming," Proc. 30th Ann. Int'l Symp. Microarchitecture, Dec. 1997.
30. D.W. Wall, "Global Register Allocation at Link-Time," Proc. Symp. Compiler Construction, Jan. 1986.
31. L. Widigen, E. Sowadksy, and K. McGrath, "Eliminating Operand Read Latency," Computer Architecture News, vol. 24, no. 5, Dec. 1996.
32. K.M. Wilson, K. Olukotun, and M. Rosenblum, "Increasing Cache Port Efficiency for Dynamic Superscalar Processors," Proc. 23rd Int'l Symp. Computer Architecture, May 1996.