The HdpH DSLs for scalable reliable computation
Maier P, Stewart R & Trinder P (2014) The HdpH DSLs for scalable reliable computation. In: Haskell '14: Proceedings of the 2014 ACM SIGPLAN symposium on Haskell. 2014 ACM SIGPLAN symposium on Haskell, Gothenburg, Sweden, 04.09.2014-05.09.2014. New York: ACM Press, pp. 65-76. https://doi.org/10.1145/2633357.2633363
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 placement and stealing topology aware whereas HdpH-RS delivers reliability by means of fault tolerant work stealing. We present operational semantics for both DSLs and investigate conditions for semantic equivalence of HdpH and HdpH-RS programs, that is, conditions under which topology awareness can be transparently traded for fault tolerance. We detail how the DSL implementations realise topology awareness and fault tolerance. We report an initial evaluation of scalability and fault tolerance on a 256-core cluster and on up to 32K cores of an HPC platform.
embedded domain specific languages; parallelism; topology awareness; fault tolerance;
|Funders||Engineering and Physical Sciences Research Council, Engineering and Physical Sciences Research Council and Engineering and Physical Sciences Research Council|
|Place of publication||New York|
|Conference||2014 ACM SIGPLAN symposium on Haskell|
|Conference location||Gothenburg, Sweden|