DMCA
Parallelizing Nonnumerical Code with Selective Scheduling and Software Pipelining (1997)
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 27 - 6 self |
BibTeX
@ARTICLE{Moon97parallelizingnonnumerical,
author = {Soo-mook Moon and Kemal Ebcioglu},
title = {Parallelizing Nonnumerical Code with Selective Scheduling and Software Pipelining},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1997},
volume = {19},
pages = {853--898}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
this article, we introduce a new code-scheduling technique for irregular ILP called "selective scheduling" which can be used as a component for superscalar and VLIW compilers. Selective scheduling can compute a wide set of independent operations across all execution paths based on renaming and forward-substitution and can compute available operations across loop iterations if combined with software pipelining. This scheduling approach has better heuristics for determining the usefulness of moving one operation versus moving another and can successfully find useful code motions without resorting to branch profiling. The compiletime overhead of selective scheduling is low due to its incremental computation technique and its controlled code duplication. We parallelized the SPEC integer benchmarks and five AIX utilities without using branch probabilities. The experiments indicate that a fivefold speedup is achievable on realistic resources with a reasonable overhead in compilation time and code expansion and that a solid speedup increase is also obtainable on machines with fewer resources. These results improve previously known characteristics of irregular ILP.
Keyphrases
selective scheduling nonnumerical code software pipelining irregular ilp new code-scheduling technique available operation compilation time aix utility branch probability execution path incremental computation technique spec integer benchmark solid speedup increase controlled code duplication vliw compiler code expansion fivefold speedup wide set reasonable overhead realistic resource compiletime overhead loop iteration independent operation useful code motion operation versus
