Reducing branch costs via branch alignment

International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS

Volumn Part F129531, Issue , 1994, Pages 242-251

  Calder, Brad ^a   Grunwald, DIrk ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Branch Prediction; Branch Target Buffers; Profile based Optimization; Trace Scheduling

Indexed keywords

ALIGNMENT; COSTS; FORECASTING; OPTIMIZATION; PROGRAM COMPILERS;

ALIGNMENT ALGORITHMS; BASIC-BLOCK REORDERING; BINARY TRANSFORMATION; BRANCH PREDICTION; BRANCH TARGET BUFFERS; COST MODELING; HIGHLY ACCURATE; INSTRUCTION CACHES;

COST REDUCTION;

EID: 85013569584     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195473.195553     Document Type: Conference Paper

References (27)

1. W. A. Abu-Sufah, D. J. Kuck, D. H. Lawrie. On the performance enhancement of paging systems through program analysis and transformation. IEEE Transactions on Computers, C-30(5):341-356, May 1981.
2. R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfield, B. Smith. The tera computer system. In International Conference on Supercomputing, pages 1-6, June 1990.
3. T. Ball and J. R. Larus. Branch prediction for free. In 1993 SIGPLAN Conference on Programming Language Design and Implementation. ACM, June 1993.
4. Brian Bray and M. J. Flynn. Strategies for branch target buffers. In 24th Workshop on Microprogramming and Microarchitecture, pages 42-49. ACM, ACM, 1991.
5. Brad Calder and Dirk Grunwald. Fast & accurate instruction fetch and branch prediction. In 21st Annual Annual International Symposium on Computer Architecture, SIGARCH Newsletter. ACM, April 1994.
6. Brad Calder, Dirk Grunwald, Benjamin Zorn. Quantifying behavioral differences between C and C++ programs. Technical Report CU-CS-698, University of Colorado-Boulder, January 1994.
7. David R. Ditzel and HubertR. McLellan. Branch folding in the CRISP microprocessor: Reducing branch delay to zero. In 14th Annual Annual International Symposium on Computer Architecture, SIGARCH Newsletter, pages 2-9. ACM, ACM, June 1987.
8. Domenico Ferrari. Improving locality by critical working sets. Communications of the ACM, 17(11):614-620, 1974.
9. J. A. Fisher and S. M. Freudenberger. Predicting conditional branch directions from previous runs of a program. In Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 85-95, Boston, Mass., October 1992. ACM.
10. S. J. Hartley. Compile-time program restructuring in multipro-grammed virtual memory systems. IEEE Transactions on Software Engineering, 14(11):1640-1644, 1988.
11. D. Hatfield and J. Gerald. Program restructuring for virtual memory. IBM Systems Journal, 10(3):168-192, 1971.
12. DavidR. Kaeli and Philip G. Emma. Branch history table prediction of moving target branches due to subroutine returns. In 18th Annual International SymposiumofComputer Architecture, pages 34-42. ACM, May 1991.
13. Brian Kemighan. Optimal sequential partitions of graphs. Journalof the ACM, 18(1):34-40, 1971.
14. Johnny K. F. Lee and Alan Jay Smith. Branch prediction strategies and branch target buffer design. IEEE Computer, 21 (7):6-22, January 1984.
15. Scott McFarling. Program optimization for instruction caches. In 3rd International Conference on Architectural Support for Programming Languages and Operating Systems, pages 183-191. ACM, 1988.
16. Scott McFarling. Combining branch predictors. TN 36, DEC-WRL, June 1993.
17. Scott McFarling and John Hennessy. Reducing the cost of branches. In 13th Annual International Symposium of Computer Architecture, pages 396-403. ACM, 1986.
18. Wenmei W. Hwu and Pohua P. Chang. Achieving high instruction cache performance with an optimizing compiler. In 16th Annual International Symposium of Computer Architecture, pages 242-251. ACM, ACM, 1989.
19. S.-T. Pan, K. So, J. T. Rahmeh. Improving the accuracy of dynamic branch prediction using branch correlation. In Fifth International Conference on Architectural B for Programming Languages and Operating Systems, pages 76-84, Boston, Mass., October 1992. ACM.
20. Chris Perleberg and Alan Jay Smith. Branch target buffer design and optimization. IEEE Transactions on Computers, 42(4):396-412, April 1993.
21. Karl Pettis and Robert C. Hansen. Profile guided code positioning. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, pages 16-27. ACM, ACM, June 1990.
22. J. E. Smith. A study of branch prediction strategies. In 8th Annual International Symposium of Computer Architecture. ACM, 1981.
23. Amitabh Srivastava and Alan Eustace. Atom: A system for building customized program analysis tools. In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. ACM, 1994.
24. Amitabh Srivastava and David W. Wall. A practical system for intermodule code optimizations at link-time. Journal of Programming Languages, March 1993.
25. Amitabh Srivastava and David W. Wall. Link-time optimizations of address calculation on a 64-bit architecture. In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. ACM, 1994.
26. Tse-Yu Yeh and Yale N. Patt. A comprehensive instruction fetch mechanism for a processor supporting speculative execution. In 25th Annual International Symposium on Microarchitecture, pages 129-139, Portland, Or, December 1992. ACM.
27. Tse-Yu Yeh and Yale N. Patt. Acomparisonofdynamicbranchpredic-tors that use two levels of branch history. In 20th Annual International Symposiumof Computer Architecture, pages 257-266, San Diego, CA, May 1993. ACM.