Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell 2014
DOI: 10.1145/2633357.2633363
|View full text |Cite
|
Sign up to set email alerts
|

The HdpH DSLs for scalable reliable computation

Abstract: The statelessness of functional computations facilitates both parallelism and fault recovery. Faults and non-uniform communication topologies are key challenges for emergent large scale parallel architectures. We report on HdpH and HdpH-RS, a pair of Haskell DSLs designed to address these challenges for irregular task-parallel computations on large distributed-memory architectures. Both DSLs share an API combining explicit task placement with sophisticated work stealing. HdpH focuses on scalability by making p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 26 publications
0
11
0
Order By: Relevance
“…This makes the proposed approach limited in its fault tolerance, and further analysis and a clear fault model are needed. HdpH [Maier et al 2014;Stewart 2013;Stewart et al 2016] is a variant of distributed parallel Haskell for reliable computation. HdpH does provides monitoring and recovering capabilities but, like other proposals for distributed Haskell, its fault tolerance mechanisms are applied during runtime, not during compile time, and it does not provide a mechanism to verify the correct handling of fault classes.…”
Section: Ivan Perezmentioning
confidence: 99%
“…This makes the proposed approach limited in its fault tolerance, and further analysis and a clear fault model are needed. HdpH [Maier et al 2014;Stewart 2013;Stewart et al 2016] is a variant of distributed parallel Haskell for reliable computation. HdpH does provides monitoring and recovering capabilities but, like other proposals for distributed Haskell, its fault tolerance mechanisms are applied during runtime, not during compile time, and it does not provide a mechanism to verify the correct handling of fault classes.…”
Section: Ivan Perezmentioning
confidence: 99%
“…is paper considers two di erent parallel frameworks/runtimes each embodying the same asynchronous task-parallel model: HdpH [16], a domain speci c language embedded into Haskell, and HPX [14], a parallel runtime system for C++. Speci cs related to coordinating parallel combinatorial search applications are layered as libraries on top of these frameworks: the Haskell Tree Search Library (HTSL) and the prototype C++ Tree Search Library (CTSL).…”
Section: Task Parallel Libraries For Scalable Parallel Searchmentioning
confidence: 99%
“…e HdpH framework [16] provides distributed memory task-parallelism for the Haskell programming language. Tasks are managed via two work-stealing schedulers: A local thread scheduler for tasks that have been scheduled for execution within a process, and a spark scheduler that manages unscheduled tasks (called "sparks").…”
Section: Haskell Tree Search Librarymentioning
confidence: 99%
See 1 more Smart Citation
“…SGP2 exposes parallel patterns to the programmer as algorithmic skeletons , implemented in HdpH . HdpH is described in detail elsewhere , and here, we discuss only the small part of the API which users of the SGP2 skeleton library are exposed to, as outlined in Figure . As is customary in functional programming languages, the HdpH DSL is embedded into the host language, Haskell, by wrapping DSL computations in a special computation type.…”
Section: The Design and Implementation Of Symgridpar2mentioning
confidence: 99%