Abstract
The state of the art in vectorizing and parallelizing compilers has overcome the language barrier and offers a viable (and not necessarily exclusive) alternative to parallel programming. The evolution of parallel programming languages has not kept up with the evolution of parallel architectures [KDLS86], [GGKM83], [Chen83], [MiUc84]. Even though this may change in the future, currently we are confined to using enhanced versions of existing languages which do not provide either the power or the flexibility for programming modern parallel supercomputers [ANSI86], [GuPL88], [MeRo85]. Under this reality parallel programming remains still a highly complex and empirical art, even for the skillful programmer. Parallelizing compilers offer a solution to both of these problems. A serial program can be automatically vectorized and/or parallelized, and in many cases automatic concurrentization can proceed to the maximum possible degree.
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). A Comprehensive Environment for Automatic Packaging and Scheduling of Parallelism. 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_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1077-8_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8416-1
Online ISBN: 978-1-4613-1077-8
eBook Packages: Springer Book Archive