Near-optimal intraprocedural branch alignment
- 1 May 1997
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 32 (5) , 183-193
- https://doi.org/10.1145/258915.258932
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Performance of linear-space search algorithmsArtificial Intelligence, 1995
- A comparative analysis of schemes for correlated branch predictionPublished by Association for Computing Machinery (ACM) ,1995
- SUIFACM SIGPLAN Notices, 1994
- Improving semi-static branch prediction by code replicationPublished by Association for Computing Machinery (ACM) ,1994
- The superblock: An effective technique for VLIW and superscalar compilationThe Journal of Supercomputing, 1993
- The multiflow trace scheduling compilerThe Journal of Supercomputing, 1993
- Exact Solution of Large Asymmetric Traveling Salesman ProblemsScience, 1991
- Local Search for the Asymmetric Traveling Salesman ProblemOperations Research, 1980
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970