Abstract
A new model of parallel computation is presented that provides appropriate cost models for automatic systems parallelization. We demonstrate its utility in automatic optimization for vectorization and provide a reference to more elaborate examples.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
V.S. Adve, et al., “Requirements for data-parallel programming environments,” IEEE Parallel and Distributed Technology, July 1994, pp. 234–239.
G.R. Andrews and F.B. Schneider, “Concepts and notations for concurrent programming,” Computing Surveys, vol. 266, no. 24, 1983, pp. 132–145.
D. Culler, et al., “LogP: Towards a realistic model of parallel computation,” in Proc. 4th ACM SIGPLAN Symposium on PPoPP, May 1993, pp. 1–12.
A.J.C. van Gemund, Performance Modeling of Parallel Systems. PhD thesis, Delft University of Technology, Apr. 1996.
R.W. Hockney and C.R. Jesshope, Parallel Computers 2 — Architecture, Programming and Algorithms. Adam Hilger, 1981.
W. Kreutzer, System simulation, programming styles and languages. Addison-Wesley, 1986.
D.B. Skillicorn, “A cost calculus for parallel functional programming,” Journal of Parallel and Distributed Computing, vol. 28, 1995, pp. 65–83.
L. Valiant, “A bridging model for parallel computation,” Communications of the ACM, vol. 33, Aug. 1990, pp. 103–111.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Gemund, A.J.C. (1996). SPC: A model of parallel computation. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024728
Download citation
DOI: https://doi.org/10.1007/BFb0024728
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive