2011
DOI: 10.1080/17445760.2010.481785
|View full text |Cite
|
Sign up to set email alerts
|

CPS implementation of a BSP composition primitive with application to the implementation of algorithmic skeletons

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…BSML is clearly a lower level programming language compared to algorithmic skeletons for example but it comes with a realistic cost model and is well adapt to the writing coarse-grain algorithms. Moreover, it can be used to implement higher-order parallel functions that could be used as algorithmic skeletons [9].…”
Section: Related Workmentioning
confidence: 99%
“…BSML is clearly a lower level programming language compared to algorithmic skeletons for example but it comes with a realistic cost model and is well adapt to the writing coarse-grain algorithms. Moreover, it can be used to implement higher-order parallel functions that could be used as algorithmic skeletons [9].…”
Section: Related Workmentioning
confidence: 99%
“…FURTHER READING a) BSML: While being more concise than BSPlib, BSML is however equally expressive [22]. In addition to the primitives presented in this paper, BSML has been extended by parallel compositions [23], [24], [25], [26], parallel exceptions handling [27], and IO. These features are not available in the public release yet.…”
Section: Map and Reduce With Spoc And Sarekmentioning
confidence: 99%