Abstract
Parallel functional programming could be made more efficient if the paradigm used was clearly identified. A paradigm can be expressed by defining a template called a parallel algorithmic structure. As a case study, this paper addresses the issue of defining a parallel structure for the static iterative transformation paradigm. It shows how a specification can be successively turned into a sequential functional program, then into a parallel program, and finally into a program that maps on a specific parallel architecture.
This article was processed using the LaTEX macro package with LLNCS style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Cole, Higher-Order functions for parallel evaluation, In Proc. Workshop on Functional Programming, C. Hall et al. (Eds), Glasgow, August 1988, pp. 8–20.
A.J.G. Hey, Experiments in MIMD parallelism, In PARLE'89 Conference, LNCS 266, pp. 28–42.
H.T. Kung, Computational models for parallel computers, In Scientific Applications of Multiprocessors, R.J. Elliott and C.A.R. Hoare (Eds), Prentice Hall International, 1989, pp. 1–15.
F.A. Rabhi, Parallel Programming Paradigms: A Functional Programming Approach, Internal report, Department of Computer Science, University of Hull, May 1992.
F.A. Rabhi, A “Paradigm-First” Approach in the Design and Implementation of Parallel Functional Programs, Internal report, Department of Computer Science, University of Hull, May 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rabhi, F.A. (1992). A parallel structure for static iterative transformation algorithms. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_480
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_480
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive