Patterns and Skeletons for Parallel and Distributed Computing 2003
DOI: 10.1007/978-1-4471-0097-3_1
|View full text |Cite
|
Sign up to set email alerts
|

Foundations of Data-parallel Skeletons

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…The term algorithmic skeletons was coined by Cole [15] to denote high-level constructs encapsulating parallelism, communication, and synchronization, having an associated cost complexity. They originate from the need for programming languages designed from a fixed set of constructs capturing common computation patterns [6] and from the fact that many parallel applications share a common set of known interaction patterns like processor farms or pipelines [15,20]. The key idea behind algorithmic skeletons is that there exists a set of functions on structured data types called catamorphisms [43] that respects the way in which objects of their type is built.…”
Section: Exploiting Parallelismmentioning
confidence: 99%
See 1 more Smart Citation
“…The term algorithmic skeletons was coined by Cole [15] to denote high-level constructs encapsulating parallelism, communication, and synchronization, having an associated cost complexity. They originate from the need for programming languages designed from a fixed set of constructs capturing common computation patterns [6] and from the fact that many parallel applications share a common set of known interaction patterns like processor farms or pipelines [15,20]. The key idea behind algorithmic skeletons is that there exists a set of functions on structured data types called catamorphisms [43] that respects the way in which objects of their type is built.…”
Section: Exploiting Parallelismmentioning
confidence: 99%
“…merges two vectors element-wise while performing partial application on the functions "below" accordingly, and An important theorem in the theory of algorithmic skeletons, factorization [20,43], states that a function h is a catamorphism if it can be factorized like in Equation (2). As of this, the skeletons in Table 3, usually used in CPS design, are in fact patterns of map (i.e., the generic farm S ) and reduce (i.e., reduce S ).…”
Section: Skeleton Layer Definitionsmentioning
confidence: 99%
“…If we consider signals wrapped in regular structures H(S) (short-hand S ), then we can formulate homomorphisms as atoms on those structures, taking processes as arguments. As a consequence those atoms will instantiate regular networks of processes which expose the inherent parallelism, concluding that the atoms specific to this layer are indeed algorithmic skeletons [12].…”
Section: E the Skeleton Layermentioning
confidence: 99%
“…3) Algorithmic skeletons: Cole coined this term [10] to denote high-level constructs encapsulating parallelism, communication and synchronization with an associated cost complexity. The key idea behind algorithmic skeletons is that there exists a set of functions on structured data types called homomorphisms which respect the way in which objects of their type are built [11], [12]. Intuitively, homomorphisms enable computation on separate parts of a large data structure to be performed in parallel.…”
Section: Introductionmentioning
confidence: 99%