Abstract
Optimizing compilers in general, and parallelizing compilers in particular, try to improve the performance of programs by performing a series of transformations. A transformation is an optimization if a set (possibly empty) of conditions is satisfied. These conditions are derived from a comparison of the cost functions of the original and the transformed code. The ideal cost function is the real execution time of the program, which in the case of an arbitrary program is not computable even if its data are given. Therefore, it is essential to find heuristics for estimating the execution time of programs at various granularity levels, for example program, subprogram, loop, basic block, statement, and expression.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
(1995). Timing Analysis and Scheduling. In: Symbolic Analysis for Parallelizing Compilers. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-26829-3_6
Download citation
DOI: https://doi.org/10.1007/978-0-585-26829-3_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9623-9
Online ISBN: 978-0-585-26829-3
eBook Packages: Springer Book Archive