2017 · 14 citations · 14 references
ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsFault Tolerance In Parallel SystemsFault-tolerant Parallel AlgorithmsFault-tolerant SchedulingParallel Runtime SystemsExecution Time AnalysisFault Tolerance MechanismsFault-tolerant Resource ManagementNode FailuresTask PoolsThroughputTree SearchTree Search Algorithms
Current HPC environments require parallel programs that are both malleable and fault-tolerant. Malleability denotes the ability to embrace system-initiated resource changes, and fault tolerance denotes the ability to cope with, e.g., permanent node failures.This paper considers the task pool pattern, specifically its lifeline-based variant. It builds on a previous fault-tolerant realization, and integrates the ability to add resources. We suggest a growth protocol that is able to cope with failures of old and new resources during its execution. New resources replace failed ones in one data structure, while getting a new role in another.The algorithm was implemented in a framework for the programming language X10. Correctness tests and performance measurements used the Unbalanced Tree Search (UTS) benchmark. We compared the performance on a constant vs. varying number of workers with same average, and observed negligible differences in execution time and task throughput.
14
Ion Stoica, Robert Morris, David R. Karger et al. · 2001 · 9.7K citations
Leonardo Bautista-Gomez, Seiji Tsuboi, Dimitri Komatitsch et al. · 2011 · 292 citations
Lifeline-based global load balancing
Vijay Saraswat, Prabhanjan Kambadur, Sreedhar Kodali et al. · 2011 · 98 citations