Abstract
This paper focuses on the compile-time cost analysis of programs expressed in the BMF-style, which results in the selection of a cost-effective parallel implementation on a given topology.
Chapter PDF
Keywords
- Cost Model
- Sequential Implementation
- Parallel Programming Model
- Single Program Multiple Data
- Logical Neighbour
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
Richard Bird. Algebraic identities for program calculation. The Computer Journal, 32(2):122–126, 1989.
Murray Cole. Higher-order functions for parallel evaluation. In Proceedings of the 1988 Glasgow Workshop on Functional Programming, pages 8–20, August 1988.
Roopa Rangaswami. HOPP — a higher-order parallel programming model. In Marc Moonen, editor, Algorithms and Parallel VLSI Architectures. Elsevier, 1995.
Roopa Rangaswami. A Cost Analysis for a Higher-order Parallel Programming Model. PhD thesis, University of Edinburgh, 1996. To be published.
David B Skillicorn and Wentong Cai. A cost calculus for parallel functional programming. Technical report, Department of Computing and Information Sciences, Queens University, Kingston, Canada, March 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rangaswami, R. (1996). Compile-time cost analysis for parallel programming. 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/BFb0024731
Download citation
DOI: https://doi.org/10.1007/BFb0024731
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