Kilo-instruction processors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2858, Issue , 2003, Pages 10-25

  Cristal, Adrián ^a   Ortega, Daniel ^a   Llosa, Josep ^a   Valero, Mateo ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

IN-FLIGHT INSTRUCTIONS; KILO-INSTRUCTION PROCESSORS; MEMORY SPEED; OUT-OF-ORDER PROCESSORS; PHYSICAL REGISTERS; PROCESSOR SPEED; RE-ORDER BUFFERS; SUPERSCALAR;

MICROPROCESSOR CHIPS;

EID: 0242370931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39707-6_2     Document Type: Article

References (33)

1. R. Balasubramonian, S. Dwarkadas, and D. Albonesi. Dynamically allocating processor resources between nearby and distant ilp. In Proceedings of the 28th annual international symposium on on Computer architecture, pages 26-37. ACM Press, 2001.
2. E. Brekelbaum, J. Rupley, C. Wilkerson, and B. Black. Hierarchical scheduling windows. In Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture, pages 27-36. IEEE Computer Society Press, 2002.
3. M.D. Brown, J. Stark, and Y.N. Patt. Select-free instruction scheduling logic. In Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture, pages 204-213. IEEE Computer Society, 2001.
4. A. Cristal, J.F. Martínez, J. Llosa, and M. Valero. A case for resourceconscious out-of-order processors. Technical Report UPC-DAC-2003-45, Universidad Politécnica de Cataluña, Department of Computer Architecture, July 2003.
5. A. Cristal, D. Ortega, J.F. Martínez, J. Llosa, and M. Valero. Out-of-order commit processors. Technical Report UPC-DAC-2003-44, Universidad Politécnica de Cataluña, Department of Computer Architecture, July 2003.
6. A. Cristal, M. Valero, A. Gonzalez, and J. LLosa. Large virtual robs by processor checkpointing. Technical Report UPC-DAC-2002-39, Universidad Politécnica de Cataluña, Department of Computer Architecture, July 2002.
7. J-L. Cruz, A. González, M. Valero, and N. P. Topham. Multiple-banked register file architectures. In Proceedings of the 27th annual international symposium on Computer architecture, pages 316-325. ACM Press, 2000.
8. Keith I. Farkas, Paul Chow, Norman P. Jouppi, and Zvonko Vranesic. Memorysystem design considerations for dynamically-scheduled processors. In Proceedings of the 24th annual international symposium on Computer architecture, pages 133-143. ACM Press, 1997.
9. D. Folegnani and A. González. Energy-effective issue logic. In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 230-239, Göteborg, Sweden, June 30-July 4, 2001. IEEE Computer Society and ACM SIGARCH. Computer Architecture News, 29(2), May 2001.
10. A. González, J. González, and M. Valero. Virtual-physical registers. In IEEE International Symposium on High-Performance Computer Architecture, February 1998.
11. J.L. Hennessy and D.A. Patterson. Computer Architecture. A Quantitative Approach. Second Edition. Morgan Kaufmann Publishers, San Francisco, 1996.
12. W.M. Hwu and Y. N. Patt. Checkpoint repair for out-of-order execution machines. In Proceedings of the 14th annual international symposium on Computer architecture, pages 18-26. ACM Press, 1987.
13. N. P. Jouppi and P. Ranganathan. The relative importance of memory latency, bandwidth, and branch limits to performance. In Workshop of Mixing Logic and DRAM: Chips that Compute and Remember. ACM Press, 1997.
14. A.R. Lebeck, J. Koppanalil, T. Li, J. Patwardhan, and E. Rotenberg. A large, fast instruction window for tolerating cache misses. In Proceedings of the 29th annual international symposium on Computer architecture, pages 59-70. IEEE Computer Society, 2002.
15. J. Lo, S. Parekh, S. Eggers, H. Levy, and D. Tullsen. Software-directed register deallocation for simultaneous multithreaded processors. Technical Report TR-97-12-01, University of Washington, Department of Computer Science and Engineering, 1997.
16. L.A. Lozano and G.R. Gao. Exploiting short-lived variables in superscalar processors. In Proceedings of the 28th annual international symposium on Microarchitecture. IEEE Computer Society Press, November 1995.
17. M.M. Martin, A. Roth, and C.N. Fischer. Exploiting dead value information. In Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture. IEEE Computer Society Press, December 1997.
18. J.F. Martínez, A. Cristal, M. Valero, and J. Llosa. Ephemeral registers. Technical Report CSL-TR-2003-1035, Cornell Computer Systems Lab, 2003.
19. J.F. Martínez, J. Renau, M.C. Huang, M. Prvulovic, and J. Torrellas. Cherry: checkpointed early resource recycling in out-of-order microprocessors. In Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture, pages 3-14. IEEE Computer Society Press, 2002.
20. E. Morancho, J.M. Llabería, and A. Olivé. Recovery mechanism for latency misprediction. Technical Report UPC-DAC-2001-37, Universidad Politécnica de Cataluña, Department of Computer Architecture, November 2001.
21. M. Moudgill, K. Pingali, and S. Vassiliadis. Register renaming and dynamic speculation: an alternative approach. In Proceedings of the 26th annual international symposium on Microarchitecture, pages 202-213. IEEE Computer Society Press, 1993.
22. O. Mutlu, J. Stark, C. Wilkerson, and Y.N. Patt. Runahead execution: An alternative to very large instruction windows for out-of-order processors. In Proceedings of the Ninth International Symposium on High-Performance Computer Architecture, Anaheim, California, February 8-12, 2003. IEEE Computer Society TCCA.
23. S. Palacharla, N.P. Jouppi, and J.E. Smith. Complexity-effective superscalar processors. In Proceedings of the 24th international symposium on Computer architecture, pages 206-218. ACM Press, 1997.
24. I. Park, M. Powell, and T. Vijaykumar. Reducing register ports for higher speed and lower energy. In Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture, pages 171-182. IEEE Computer Society Press, 2002.
25. A. Seznec, E. Toullec, and O. Rochecouste. Register write specialization register read specialization: a path to complexity-effective wide-issue superscalar processors. In Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture, pages 383-394. IEEE Computer Society Press, 2002.
26. T. Sherwood, E. Perelman, and B. Calder. Basic block distribution analysis to find periodic behavior and simulation points in applications. In Proceedings of the Intl. Conference on Parallel Architectures and Compilation Techniques, pages 3-14, September 2001.
27. D. Sima. The design space of register renaming techniques. In Micro, IEEE , Volume: 20 Issue: 5, pages 70-83. IEEE Computer Society, September 1999.
28. K Skadron, P.A. Ahuja, M. Martonosi, and D.W. Clark. Branch prediction, instruction-window size, and cache size: Performance trade-offs and simulation techniques. In IEEE transactions on Computers, pages 1260-1281. IEEE Computer Society, 1999.
29. J. Stark, M.D. Brown, and Y.N. Patt. On pipelining dynamic instruction scheduling logic. In Proceedings of the 33rd Annual International Symposium on Microarchitecture, pages 57-66, Monterey, California, December 10-13, 2000. IEEE Computer Society TC-MICRO and ACM SIGMICRO.
30. R.M. Tomasulo. An efficient algorithm for exploiting multiple arithmetic units. January 1967.
31. J. Tseng and K. Asanovic. Energy-efficient register access. In XIII Symposium on Integrated Circuits and System Design, September 2000.
32. S. Wallace and N. Bagherzadeh. A scalable register file architecture for Dynamically scheduled processors. In Proceedings: Parallel Architectures and Compilation Techniques, October 1996.
33. W.A. Wulf and S.A. McKee. Hitting the memory wall: Implications of the obvious. In Computer Architecture News, pages 20-24, 1995.