Concrete data structures and functional parallel programming

A framework is presented for designing parallel programming languages whose semantics is functional and where communications are explicit. To this end, Brookes and Geva's generalized concrete data structures are specialized with a notion of explicit data layout to yield a CCC of distributed str...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 258; H. 1; S. 233 - 267
Hauptverfasser: Hains, Gaétan, Loulergue, Frédéric, Mullins, John
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 2001
Elsevier
Schlagworte:
Applied sciences
Computer Science
Computer science; control theory; systems
Concrete data structures
Deterministic parallel programming
Exact sciences and technology
Functional programming
Language theory and syntactical analysis
Semantic models
Theoretical computing
Concrete data structures
Functional programming
Semantic models
Deterministic parallel programming
Parallel programming
Semantics
Sequential language
Berry Curien exponential
Concrete data structure
Data structure
Deterministic approach
semantic model
Programming theory
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A framework is presented for designing parallel programming languages whose semantics is functional and where communications are explicit. To this end, Brookes and Geva's generalized concrete data structures are specialized with a notion of explicit data layout to yield a CCC of distributed structures called arrays. Arrays’ symmetric replicated structures, suggested by the data-parallel SPMD paradigm, are found to be incompatible with sum types. We then outline a functional language with explicitly distributed (monomorphic) concrete types, including higher-order, sum and recursive ones. In this language, programs can be as large as the network and can observe communication events in other programs. Such flexibility is missing from current data-parallel languages and amounts to a fusion with their so-called annotations, directives or meta-languages.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(00)00010-4