Parallel elementwise processable functions in concurrent clean

Zsók, Viktória; Serrarens, Pascal R.; Plasmeijer, Rinus

doi:10.1016/s0895-7177(03)90071-9

Cited by 5 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, these AS K F provide specific statements to manipulate processes and input/output data streams and present complete programming environments. On the other hand, skeletons have been introduced through Haskell functors into Concurrent Clean 50, into ML with the Parallel ML with Skeletons (PMLS) notation 51, OCamlP3l 52, and the Skipper system 53, and into Hope 54. These functors allow the expression of skeletons without disrupting the syntax in the original language.…”

Section: Functional Classificationmentioning

confidence: 99%

A survey of algorithmic skeleton frameworks: high‐level structured parallel programming enablers

2010

View full text Add to dashboard Cite

Structured parallel programs ought to be conceived as two separate and complementary entities: computation, which expresses the calculations in a procedural manner, and coordination, which abstracts the interaction and communication. By abstracting commonly used patterns of parallel computation, communication, and interaction, algorithmic skeletons enable programmers to code algorithms without specifying platform‐dependent primitives. This article presents a literature review on algorithmic skeleton frameworks (ASKF), parallel software development environments furnishing a collection of parameterizable algorithmic skeletons, where the control flow, nesting, resource monitoring, and portability of the resulting parallel program is dictated by the ASKF as opposed to the programmer. Consequently, the ASKF can be positioned as high‐level structured parallel programming enablers, as their systematic utilization permits the abstract description of programs and fosters portability by focusing on the description of the algorithmic structure rather than on its detailed implementation. Copyright © 2010 John Wiley & Sons, Ltd.

show abstract