Kent D. Wilken
- 1 J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. Elsevier Science Publishing Co., Inc., 1976. Google Scholar
Digital Library
- 2 G. Chaitin et al. Register allocation via coloring. Computer Languages, 6:47-57, 1981.Google ScholarCross Ref
- 3 J. Davidson and D. Whalley. Reducing the cost of branches by using registers. In ISCA 17, pages 182-191, 1990. Google ScholarDigital Library
- 4 D. Ditzel and H. McLellan. Branch folding in the crisp microprocessor: Reducing brandl delay to zero. In ISCA 1,i, pages 2-9, 1987. Google Scholar
- 5 C. N. Fischer and R. J. LeBlaalc. Crafting a Compiler. The Benjamin/CununJngs Publishing Conlpany, Inc., 1988. Google ScholarDigital Library
- 6 J. Hemlessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 1990. Google ScholarDigital Library
- 7 IBM. IBM RISC System//6000 Technology. IBM, 1990.Google Scholar
- 8 M. Jolmson. Superscalar Microprocessor Design. Prentice Hall, 1991.Google Scholar
- 9 J. Lee aald A. J. Smith. Branch prediction strategies and branch target buffer design. IEEE Computer, pages 6-22, January 1984.Google Scholar
- 10 D. Lilja. Reducing the branch penalty in pipelined processors. Computer, 21(7):47-55, July 1988. Google ScholarDigital Library
- 11 Sml Microsystems. The $PARC Architecture Manual, Version 7. Still Microsystelns, 1987.Google Scholar
- 12 Hewlett Packard. PA-RISC 1.1 Architecture and Instruction Set Reference Manual. Hewlett Packard, 1990.Google Scholar
- 13 T. Yeh and Y. N. Patt. Alternative implementations of twolevel adaptive branch prediction. In I$CA 19, pages 124-1:34, 1992. Google Scholar
Index Terms
- Toward zero-cost branches using instruction registers
Recommendations
Reducing the cost of branches by using registers
Special Issue: Proceedings of the 17th annual international symposium on Computer ArchitectureIn an attempt to reduce the number of operand memory references, many RISC machines have thirty-two or more general-purpose registers (e.g., MIPS, ARM, Spectrum, 88K). Without special compiler optimizations, such as inlining or interprocedural register ...
Reducing the cost of branches by using registers
ISCA '90: Proceedings of the 17th annual international symposium on Computer ArchitectureIn an attempt to reduce the number of operand memory references, many RISC machines have thirty-two or more general-purpose registers (e.g., MIPS, ARM, Spectrum, 88K). Without special compiler optimizations, such as inlining or interprocedural register ...
Comments