Abstract
In this chapter we consider a more idealized model according to which a program consists of a series of atomic operations. Based on this model we discuss how one can compute speedup values for inter and intra-task parallelism. Then we consider nested doacross loops and give a generalized speedup formula. Let us state the assumptions and describe the model before we proceed to the derivation of speedup formulas.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Speedup Bounds for Parallel Programs. 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_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1077-8_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8416-1
Online ISBN: 978-1-4613-1077-8
eBook Packages: Springer Book Archive