Branch Prediction for Free

ACM SIGPLAN Notices

Volumn 28, Issue 6, 1993, Pages 300-313

  Ball, Thomas ^a   Larus, James R ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976861423     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/173262.155119     Document Type: Article

References (18)

1. A. Aho, R. Sethi, and J. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, Reading, MA (1986).
2. T. Ball and J. R. Larus, “Optimally Profiling and Tracing Programs,” Conference Record of the Nineteenth ACM Symposium on Principles of Programming Languages, (Albuquerque, NM, January 19-22, 1992), pp. 59-70 ACM, (1992).
3. S. Bandyopadhyay, V. S. Begwani, and R. B. Murray, “Compiling for the CRISP Microprocessor,” Spring Compcon 87, pp. 96-100 IEEE Computer Society, (February 1987).
4. Systems Performance Evaluation Cooperative, SPEC Newsletter (K. Mendoza, editor) 1(1)(1989).
5. J. A. Fisher, “Trace Scheduling: A Technique for Global Microcode Compaction,” IEEE Transactions on Computers C-30(7) pp. 478-490 (July 1981).
6. J. A. Fisher, J. R. Ellis, J. C. Ruttenberg, and A. Nicolau, “Parallel Processing: A Smart Compiler and a Dumb Machine,” Proc. of the ACM SIGPLAN 1984 Symposium on Compiler Construction (SIGPLAN Notices) 19(6) pp. 37-47 (June 1984).
7. J. A. Fisher and S. M. Freudenberger, “Predicting Conditional Branch Directions From Previous Runs of a Program,” Proceedings of the 5th International Conference on
8. Architectural Support for Programmming Languages and Operating Systems (ACM SIGPLAN Notices) 27(9) pp. 85-95 (October 1992).
9. S. L. Graham, P. B. Kessler, and M. K. McKusick, “An Execution Profiler for Modular Programs,” Software-Practice and Experience 13 pp. 671-685 (1983).
10. G. Kane and J. Heinrich, MIPS RISC Architecture, Prentice Hall (1992).
11. J. K. F. Lee and A. J. Smith, “Branch Prediction Strategies and Branch Target Buffer Design,” Computer 17(1) pp. 6 - 22 (January 1984).
12. S. McFarling and J. Hennessy, “Reducing the Cost of Branches,” Proceedings of the 13th Annual International Symposium on Computer Architecture, pp. 396-403 ACM and IEEE Computer Society, (June 1986).
13. W. G. Morris, “CCG: A Prototype Coagulating Code Generator,” Proceedings of the SIGPLAN 91 Corference on Programming Language Design and Implementation, (Toronto, June 26-28, 1991), ACM SIGPLAN Notices 26(6) pp. 45-58 (June, 1991).
14. D. A. Patterson and J. L. Hennessy, Computer Architecture: A Quantitative Approach, Morgan, Kaufmann Publishers Inc. (1990).
15. K. Pettis and R. C. Hanson, “Profile Guided Code Positioning,” Proceedings of the ACM SIGPLAN ‘90 Corference on Programming Language Design and Implementation (SIGPLAN Notices) 25(6) pp. 16-27 ACM, (June, 1990).
16. R. L. Sites, Alpha Architecture Reference Manual, Digital Press, Burlington, MA (1992).
17. J. E. Smith, “A Study of Branch Prediction Strategies,” Proceedings of the 4th Annual International Symposium on Computer Architecture (SIGARCH Newsletter) 9(3) pp. 135-148 ACM and IEEE Computer Society, (May 1981).
18. D. W. Wall, “Predicting Program Behavior Using Real or Estimated Profiles,” Proceedings of the SIGPLAN 91 Conference on Programming Language Design and Implementation, (Toronto, June 26-28, 1991), ACM SIGPLAN Notices 26(6) pp. 59-70 (June, 1991).