Abstract
The problem of choosing the best tile size and shape to minimise the execution time of a loop nest, called the time-minimal problem, is a difficult discrete non-linear optimisation problem. Fortunately, the problem can be solved analytically when the iteration space is two-dimensional.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Xue, J. (2000). Time-Minimal Tiling. In: Loop Tiling for Parallelism. The Springer International Series in Engineering and Computer Science, vol 575. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4337-4_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4337-4_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6948-6
Online ISBN: 978-1-4615-4337-4
eBook Packages: Springer Book Archive