Abstract
Depending on the granularity of the different parts of a program we have low and high level spreading for fine and coarse grain program modules respectively. Most instances of the spreading problem are NP-Complete [GaJo79]. In this chapter we discuss optimal solutions for some instances of high level spreading, and efficient heuristics for the intractable cases.
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
© 1988 Kluwer Academic Publishers
About this chapter
Cite this chapter
Polychronopoulos, C.D. (1988). Static Task Scheduling. In: Parallel Programming and Compilers. The Kluwer International Series in Engineering and Computer Science, vol 59. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1077-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1077-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8416-1
Online ISBN: 978-1-4613-1077-8
eBook Packages: Springer Book Archive