Microarchitectural innovations: Boosting microprocessor performance beyond semiconductor technology scaling

Proceedings of the IEEE

Volumn 89, Issue 11, 2001, Pages 1560-1575

  Moshovos, Andreas ^a   Sohi, Gurindar S ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b University of Wisconsin Madison   (United States)

Author keywords

Branch prediction; High performance microprocessors; Memory dependence speculation; Microarchitecture; Out oforder execution; Speculative execution; Thread level speculation

Indexed keywords

EID: 0141896323     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/5.964438     Document Type: Article

References (72)

1. D. Alpert and D. Avnon, Architecture of the Pentium microprocessor, IEEE Micro, vol. 13, no, 3, pp. 11-21, 1993.
2. D. W. Anderson, F. J. Sparacio, and R. M. Tomasulo, The IBM system/360 model 91: Machine philosophy and instruction-handling, IBM J. Res. Develop., pp. 8-24, Jan. 1967.
3. T. Austin, DIVA: A reliable substrate for deep submicron design, in Proc. Annu. Int. Symp. Microarchitecture, Dec. 1999, pp. 196-207.
4. J. A. Butts and G. S. Sohi, A static power model for architects, in Proc. 33rd Annu. Int. Symp. Microarchitecture, Dec. 2000, pp. 248-258.
5. P.-Y. Chang, E. Hao, and Y. N. Patt, Target prediction for indirect jumps, in Proc. 24th Annu. Int. Symp. Computer Architecture, June 1997. pp. 274-283.
6. [61 R. Chappell, J. Stark, S. Kim, S. Reinhardt, and Y. Patt, Simultaneous subordinate microthreading (SSMT), in Proc. 26th Int. Symp. Computer Architecture, May 1999, pp. 186-195.
7. T.-F. Chen and J.-L. Baer, A performance study of software and hardware data prefetching schemes, in Proc. 21st Annu. Int. Symp. Computer Architecture, Apr. 1994, pp. 223-232.
8. G. Z. Chrysos and J. S. Emer, Memory dependence prediction using store sets,'' in Proc. 25th Int. Symp. Computer Architecture, June-July 1998, pp. 142-153.
9. V. De and S. Borkar, Technology and design challenges for low power and high performance, in Proc. Int. Symp. Low Power Electronics and Design, Aug. 1999, pp. 163-168.
10. K. Driesen and U. Holzle, Accurate indirect branch prediction, in Proc. 25th Annu. Int. Symp. Computer Architecture, June-July 1998, pp. 167-178.
11. M. Edahiro, S. Matsushita, VI. Yamashina, and N. Nishi, A single-chip multiprocessor for smart terminals, IEEE Micro, pp. 12-20. Jul.-Aug. 2000.
12. A. N. Eden and T. Mudge, The YAGS branch prediction scheme, in Proc. 31st Annu. Int. Symp. Microarchitecture, Nov. 1998. pp. 69-77.
13. [13j J. H. Edmondson, P. I. Rubinfeld, P. J. Bannon, B. J. Benschneider, D. Bernstein, R. W. Castelino, E. M. Cooper, D. E. Dever, D. R. Donchin, T. C. Fischer, A. K. Jain, S. Mehta, J. E. Meyer, R. P. Preston, V. Rajagopalan, C. Somanathan, S. A. Taylor, and G. M. Woirich, Internal organization of the Alpha 21164, a 300-MHz 64-bit quad-issue CMOS RISC microprocessor, Dig. Tech. J., vol. 7, no. 1, 1995.
14. M. Franklin and G. S. Sohi, ''ARB: A hardware mechanism for dynamic memory disambiguation, IEEE Trans. Comput., vol. 45, pp. 552-571. May 1996.
15. F. Gabbay and A. Medelson, Speculative execution based on value prediction, EE Dept., Technion-Israel Inst. Technology, Tech. Rep. TR-1080, Nov. 1996.
16. S. Gopal.T. K. Vijaykumar. J. E. Smith, andG. S. Sohi, Speculative versioning cache, in Proc. Int. Symp. High Performance Computer Architecture. Feb. 1998, pp. 195-205.
17. G. F. Grohoski, Machine organization of the IBM RISC system/ 6000 processor, IBM J. Res. Develop., vol. 34, pp. 37-58, Jan. 1990.
18. J. P. Halter and F. N. Najm, A gate-level leakage power reduction method for ultra-low-power CMOS circuits, in Proc. IEEE Custom Integrated Circuits Conf., May 1997, pp. 475-478.
19. J. L. Hennessy and D. A. Patterson, Computer Architecture A Quantitative Approach, 2nd ed. San Mateo, CA: Morgan Kaufmann, 1996.
20. D. Hunt, Advanced performance features of the 64-bit PA-8000, in Proc. COMPCON'95, Mar. 1995, pp. 123-128.
21. W. W. Hwu and Y. N. Patt, HPSm, a high performance restricted data flow architecture having minimal functionality, in Proc. 13th Itu. Symp. Computer Architecture. June 1986, pp. 297-307.
22. _, Checkpoint repair for high-performance out-of-order execution machines, IEEE Trans. Cornput., vol. C-36, pp. 1496-1514, Dec. 1987.
23. M. Johnson, Superscalar Design. Englewood Cliffs, NJ: PrenticeHall, 1990.
24. N. P. Jouppi, Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers, in P rue. 17th Anna. Int. Symp. Computer Architecture, May 1990, pp. 364-373.
25. K. Yeager, The MIPS R10000 superscalar microprocessor, IEEE Micro, vol. 16, pp. 28-40, Apr. 1996.
26. D. Kaeu and P. Emma, Branch history table prediction of moving targets due to subroutine returns, in Proc. 18th Int. Symp. Computer Architecture, May 1991, pp. 34-42.
27. J. Kalaoiaiianos and D. R. Kaeli, Predicting indirect branches via data compression, in Proc. 3IstAnnu. Int. Symp. Microarchitecture, Nov. 1998, pp. 270-281.
28. R. E. Kessler, E. J. McLellan, and D. A. Webb, The Alpha 21 264 architecture, in Proc. Int. Conf. Computer Design, Dec. 1998, pp. 90-95.
29. P. M. Kogge, The Architecture of Pipelined Computers. New York: McGraw-Hili, 1981.
30. D, Kroft, Lockup-free instruction fetch/prefetch cache organization, in Proc. 8th Int. Syrup. Computer Architecture, May 1981, pp. 81-87.
31. [311 J. K. F. Lee and A. J. Smith, Branch prediction strategies and branch target buffer design, IEEE Comput., vol. 17, Jan. 1984.
32. [32 j M. H. Lipasti, Value locality and speculative execution, Ph.D. dissertation, Carnegie Mellon Univ., Pittsburgh, PA, Apr. 1997.
33. [33 j M. H. Lipasti and J. P. Shen. Exceeding the dataflow limit via value prediction, in Proc. 29th Anna. Int. Symp. Microarchitecture, Dec. 1996, pp. 226-237.
34. S. Manne, A. Klauser, and D. Gnmwald, Pipeline gating: Speculation control for energy reduction, in Proc. 25th Annu. Int. Symp. Computer Architecture, June-July 1998, pp. 132-141.
35. D. Matzke, Will physical scalability sabotage performance gains?, Computer, vol. 30, pp. 37-39, Sept. 1997.
36. S. McFarling, Combining branch predictors, Digital Equipment Corp.. WRU Tech. Rep. TN-36. June 1993.
37. E. McLellan, The Alpha AXP architecture and 21 064 processor, IEEE.Micro, pp. 36-47, June 1993.
38. J. D. Meindl and J. Davis, interconnect performance limits on gigascale integration (GSI), Mater. Chem. Pliys., vol. 41, pp. 161-166, 1995.
39. A. Moshovos, Memory dependence prediction, Ph.D. dissertation, Univ. Wisconsin-Madison, Madison. Wl. Dec. 1998.
40. [40J A. Moshovos, S. E. Breach, T. N. Vijaykumar, and G. S. Sohi, Dynamic speculation and synchronization of data dependences, in P roc. 24ih Anmi. Ira. Syinp. Computer Architecture, June S997, pp. 181-193.
41. [41 ] S. Palacharla and R. E. Kessler, Evaluating stream buffers as a secondary cache replacement, in Proc. 21st Annu. Int. Symp. Computer Architecture, Apr. 1994, pp. 24-33.
42. S.-T. Pan, K. So, and J. T. Rahmch, Improving the accuracy of dynamic branch prediction using branch correlation, in Proc: 5th Int. Conf, Architectural Support for Programming Languages and Operating Systems, Oct. 1992, pp. 76-84.
43. S. .1. Pate!, M. Evers, and Y. N. Pati, Improving trace cache effectiveness with branch promotion and trace packing, in Proc. 25th Annu. Int. Svmp. Computer Architecture, June-July 1998, pp. 262-271.
44. Y. N. Patt. W. W. Hwu, and M. Shebanow, HPS, a new microarchilecture: Rationale and introduction, in Proc. 18th Annu. Workshop Microprogramming, Pacific Grove, CA, Dec. 1985, pp. 103-108.
45. A. Peleg and U. Weiser, Dynamic flow instruction cache memory organized around trace segments independent of virtual address line, U.S. Patent 5 381 533 , 1994.
46. F.. Rotenberg, AR-SMT: A microarchitectural approach to fault tolerance in microprocessors, in Proc. 29th Int. Symp. Fault-Tolerant Computing, June 1999, pp. 84-91.
47. E. Rotenberg, S. Bennett, and J. E. Smith, Trace cache: A low latency approach to high bandwidth instruction fetching, in Proc. 29th Annu. Int. Symp. Microarchltecture, Dec. 1996, pp. 24-35.
48. A. Roth, A. Moshovos, and G. S. Sohi, Dependence based prefetching for linked data structures, in Proc. 8th Int. Conf. Architectural Support for Programming Languages and Operating Systems, Oct. 1998, pp. 115-126.
49. _, Improving virtual function call target prediction via dependence-based pre-computation, in Proc. Int. Conf. Supercompuiing, June 1999, pp. 356-364.
50. A. Roth and Ci. Sohi, Speculative data-driven multithreading, in Proc. 7th Int. Symp. High-Perfarmance Architecture, Jan. 2001.
51. Y. Sazeides and J. E. Smith, The predictability of data values, in Proc. 30th Annu. Int. Symp. Microarchitecture, Dec. 1997, pp. 248-258.
52. A. Seznec, A case for two-way skewed-associative caches, in Proc. 20th Annu. Int. Svmp. Computer Architecture, May 1993, pp. 169-178.
53. A. J. Smith, Cache memories, ACM Comput. Surv., vol. 14, no. 3, pp. 473-530, 1982.
54. J. Smith and A. Pleszkim, Implementing precise Interrupts in pipelined processors, IEEE 'Irans. Comput., vol. 37, pp. 562-573, May 1988.
55. J. E. Smith, A study of branch prediction strategies, in Proc. 8th Int. Symp. Computer Architecture. May 1981, pp. 135-148.
56. A. Sodani and G. S. Sohi, Dynamic instruction reuse, in Proc. 24lh Annu. Int. Symp. Computer Architecture, June I997, pp. 194-205.
57. _, An empirical analysis of instruction repetition, in 18th Int. Conf. Architectural Support for Programming Languages and Operating Systems, Oct. 1998, pp. 35-45.
58. G. S. Sohi, Instruction issue logic for high-performance, interruptible, multiple functional unit, pipelined computers,' IEEE Trans. Comput., vol. 39, pp. 349-359, Mar. 1990.
59. G. S. Sohi, S. E. Breach, and T. Vijaykumar, Multiscalar processors, in Proc. 22nd Annu. Int. Svmp. Computer Architecture, June 1995, pp. 414-425.
60. G. S. Sohi and M. Franklin, High-bandwidth data memory systems for superscalar processors, in Proc. Int. Symp. Architectural Support for Programming Languages and Operating Systems, .Apr. 1991, pp. 53-62.
61. Y. Song and M. Dubois, Assisted execution, Dept. EE Systems, Univ. Southern California, Tech. Rep. CENG-98-25, Oct. 1998.
62. E. Sprangle. R. S. Chappeil, M. Alsup, and Y. N. Patt, The agree predictor: A mechanism for reducing negative branch history interference, in Proc. 24th Annu. Int. Symp. Computer Architecture, June 1997, pp. 284-291.
63. J. E. Thorton, Parallel operation in die control data 6600, in Proc. AFIPS Fall Joint Computer Conf. vol. 26. 1964, pp. 33-40.
64. [64- R. M. Tomasuio, An efficient algorithm for exploiting multiple arithmetic units, IBM J. Res. Develop., pp. 25-33, Jan. 1967.
65. M. Tremblay, J. Chan, S. Chaudhry. A. W. Conigliaro, and S. S. Tse, The MAJC architecture: A synthesis of parallelism and scalability, IEEE Micro, pp. 12-25, Nov.-Dec. 2000.
66. D. M. Tullsen, S. J. Eggers, and H. M. Levy, Simultaneous multithreading: Maximizing on-chip parallelism, in Proc. 22nd Annu. Int. Symp. Computer Architecture, June 1995, pp. 392-403.
67. M. Wilkes, Slave memories and dynamic storage allocation, IEEE Trans. Electron. Comput., pp. 270-271, Apr. 1965.
68. W. Yamamoto and M. Nenurovsky, Increasing superscalar performance through multistreaming, in Conf. Parallel Architectures and Compilation Techniques, June 1995, pp. 49-58.
69. S.-H. Yang, M. D. Powell, B. Falsafi, K. Roy, and T. N. Vijayktimar, An integrated circuit/architecture approach to reducing leakage in deep-submicron high-performance I-caches, in Int. Symp. High-performance Computer Architecture, Jan. 2001.
70. T.-Y. Yeh and Y N. Patt, A comprehensive instraction fetch mechanism for a processor supporting speculative execution, in Proc. 25th Anna. Int. Symp. Microarchitecture, Dec. 1992, pp. 129-139.
71. C. Young, N. Gloy, and VI. D. Smith, A comparative analysis of schemes for correlated branch prediction, in Proc. 22nd Annu. Int. Symp. Computer Architecture. June 1995, pp. 276-286.
72. C. Zilles and G. Sohi, Execution-based prediction using speculative slices, in Proc. 28th Int. Symp. Computer Architecture, July 2001.