Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleMay 1997
Near-optimal intraprocedural branch alignment
PLDI '97: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementationPages 183–193https://doi.org/10.1145/258915.258932Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We present a branch alignment algorithm that usually ...
Also Published in:
ACM SIGPLAN Notices: Volume 32 Issue 5 - ArticleMay 1997
Partial dead code elimination using slicing transformations
PLDI '97: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementationPages 159–170https://doi.org/10.1145/258915.258930We present an approach for optimizing programs that uncovers additional opportunities for optimization of a statement by predicating the statement. In this paper predication algorithms for achieving partial dead code elimination (PDE) are presented. The ...
Also Published in:
ACM SIGPLAN Notices: Volume 32 Issue 5 - ArticleMay 1997
Interprocedural conditional branch elimination
PLDI '97: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementationPages 146–158https://doi.org/10.1145/258915.258929The existence of statically detectable correlation among conditional branches enables their elimination, an optimization that has a number of benefits. This paper presents techniques to determine whether an interprocedural execution path leading to a ...
Also Published in:
ACM SIGPLAN Notices: Volume 32 Issue 5 - ArticleMay 1997
Aggressive inlining
PLDI '97: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementationPages 134–145https://doi.org/10.1145/258915.258928Existing research understates the benefits that can be obtained from inlining and cloning, especially when guided by profile information. Our implementation of inlining and cloning yields excellent results on average and very rarely lowers performance. ...
Also Published in:
ACM SIGPLAN Notices: Volume 32 Issue 5 - ArticleMay 1997
Interprocedural dataflow analysis in an executable optimizer
PLDI '97: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementationPages 122–133https://doi.org/10.1145/258915.258927Interprocedural dataflow information enables link-time and post-link-time optimizers to perform analyses and code transformations that are not possible in a traditional compiler. This paper describes the interprocedural dataflow analysis techniques used ...
Also Published in:
ACM SIGPLAN Notices: Volume 32 Issue 5