Abstract
We integrate the semantics of higher-order functional programs with a notion of explicit static processes as used in BSP and PRAM algorithms. The result is the construction of a cartesian closed category (CCC), a model for typed functional languages. Concrete data structures (CDS) yield many useful CCC and Brookes and Geva have generalised (gCDS) and used them as domains of a CCC whose arrows are asynchronous but deterministic parallel algorithms. We specialise their construction to explicit static processes by showing that data-parallel algorithms (distributed Brookes-Geva algorithms) between array structures (distributed gCDS) are themselves array structures. This model brings notions of data locality, synchronisation and higher-order functions in a unified denotational framework.
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
G. Blelloch and S. Chatterjee. VCODE: a data-parallel intermediate language. In J. JaJa, editor, 3rd IEEE Symp. Frontiers of Massively Parallel Comp., 1990.
G. E. Blelloch. Vector Models for Data-Parallel Computing. MIT Press, 1990.
L. Bougé. Le modèle de programmation à parallélisme de données: une perspective sémantique (version révisée). Research Report 94-06, LIP, école Normale Supérieure de Lyon, 1994.
S. Brookes and S. Geva. A cartesian closed category of parallel algorithms between Scott domains. Technical Report CMU-CS-91-159, Carnegie Mellon Univ., 1991.
S. Brookes and S. Geva. Continuous functions and parallel algorithms on concrete data structures. In MFPS'91, L.N.C.S. Springer, 1991.
P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. BirkhÄuser, Boston, second edition, 1993.
C. A. Gunter and D. S. Scott. Semantic domains. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science. North-Holland, MIT-Press, 1990.
G. Hains and J. Mullins. Array structures and data-parallel algorithms. Research Note RR-95-1E, ISIS, Fujitsu Labs, Makuhari, Japan, 1995. Available on http:http://web.univ.orleans.frtghains.
P. Hudak and S. Anderson. Pomset interpretations of parallel functional programs. In G. Kahn, editor, Functional Programming Languages and Computer Architecture, number 274 in Lecture Notes in Computer Science. Springer, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hains, G., Mullins, J. (1996). Array structures and data-parallel algorithms. 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/BFb0024730
Download citation
DOI: https://doi.org/10.1007/BFb0024730
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