A Robust Fault Tolerance Scheme for Lifeline-Based Taskpools

Fohry, Claudia; Bungart, Marco

doi:10.1109/icppw.2016.40

Cited by 5 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our fault-tolerant algorithm has been developed incrementally, and earlier versions have been published in [3] [4] [5]. The current paper sums up that work and presents the overall algorithm in a unified way.…”

mentioning

confidence: 93%

See 1 more Smart Citation

Fault Tolerance for Lifeline-Based Global Load Balancing

Fohry¹,

Bungart²,

Plock³

2017

JSEA

Self Cite

View full text Add to dashboard Cite

Fault tolerance has become an important issue in parallel computing. It is often addressed at system level, but application-level approaches receive increasing attention. We consider a parallel programming pattern, the task pool, and provide a fault-tolerant implementation in a library. Specifically, our work refers to lifeline-based global load balancing, which is an advanced task pool variant that is implemented in the GLB framework of the parallel programming language X10. The variant considers side effect-free tasks whose results are combined into a final result by reduction. Our algorithm is able to recover from multiple fail-stop failures. If recovery is not possible, it halts with an error message. In the algorithm, each worker regularly saves its local task pool contents in the main memory of a backup partner. Backups are updated for steals. After failures, the backup partner takes over saved copies and collects others. In case of multiple failures, invocations of the restore protocol are nested. We have implemented the algorithm by extending the source code of the GLB library. In performance measurements on up to 256 places, we observed an overhead between 0.5% and 30%. The particular value depends on the application's steal rate and task pool size. Sources of performance overhead have been further analyzed with a logging component.

show abstract

mentioning

confidence: 93%

“…UTS counts the number of nodes in a highly irregular tree, and BC calculates a centrality score for each node in a graph. The benchmark versions used in this paper differ from less-efficient ones used in [5] insofar as they store open tasks in a compact format. BC includes long-running tasks.…”

Section: Methodsmentioning

confidence: 99%