The HdpH DSLs for scalable reliable computation

MAIER, Patrick, STEWART, Robert and TRINDER, Phil (2014). The HdpH DSLs for scalable reliable computation. In: Proceedings of the 2014 ACM SIGPLAN symposium on Haskell - Haskell '14. ACM, 65-76.

[img]
Preview
PDF
Haskell12014-accepted_version.pdf - Accepted Version
All rights reserved.

Download (502kB) | Preview
Official URL: https://doi.org/10.1145/2633357.2633363
Link to published version:: 10.1145/2633357.2633363

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 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.

Item Type: Book Section
Departments: Arts, Computing, Engineering and Sciences > Art and Design
Identification Number: 10.1145/2633357.2633363
Depositing User: Patrick Maier
Date Deposited: 28 Feb 2018 13:20
Last Modified: 28 Feb 2018 13:26
URI: http://shura.shu.ac.uk/id/eprint/18619

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics