Name
Abstract | ||
|---|---|---|
In this paper we demonstrate that declarative programming is a suitable vehicle for the programming of conventional distributed-memory multiprocessors. This is achieved by applying several transformations to the compiled declarative program to extract iteration-level parallelism. The transformations first group individual instructions into sequential light-weight processes, and then insert primitives to: (1) cause array allocation to be distributed over multiple processors, (2) cause computation to follow the data distribution by inserting an index filtering mechanism into a given loop and spawning a copy of it on all PEs; the filter causes each instance of that loop to operate on a different subrange of the index variable. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1007/3-540-55599-4_111 | PARLE |
Keywords | Field | DocType |
conventional mimd multiprocessors,declarative programming,distributed memory,indexation | Procedural programming,Fifth-generation programming language,Programming language,Programming paradigm,Computer science,Parallel computing,Inductive programming,Reactive programming,Declarative programming,Execution unit,MIMD | Conference |
ISBN | Citations | PageRank |
3-540-55599-4 | 0 | 0.34 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lubomir Bic | 1 | 332 | 125.18 |
| John M. A. Roy | 2 | 0 | 0.68 |
| Mark Nagel | 3 | 0 | 0.34 |