Cluster Computing

, Volume 17, Issue 2, pp 303–313

Reverse computation for rollback-based fault tolerance in large parallel systems

Evaluating the potential gains and systems effects

DOI: 10.1007/s10586-013-0277-4

Cite this article as:
Perumalla, K.S. & Park, A.J. Cluster Comput (2014) 17: 303. doi:10.1007/s10586-013-0277-4


Reverse computation is presented here as an important future direction in addressing the challenge of fault tolerant execution on very large cluster platforms for parallel computing. As the scale of parallel jobs increases, traditional checkpointing approaches suffer scalability problems ranging from computational slowdowns to high congestion at the persistent stores for checkpoints. Reverse computation can overcome such problems and is also better suited for parallel computing on newer architectures with smaller, cheaper or energy-efficient memories and file systems. Initial evidence for the feasibility of reverse computation in large systems is presented with detailed performance data from a particle (ideal gas) simulation scaling to 65,536 processor cores and 950 accelerators (GPUs). Reverse computation is observed to deliver very large gains relative to checkpointing schemes when nodes rely on their host processors/memory to tolerate faults at their accelerators. A comparison between reverse computation and checkpointing with measurements such as cache miss ratios, TLB misses and memory usage indicates that reverse computation is hard to ignore as a future alternative to be pursued in emerging architectures.


Checkpointing Rollback Reverse computation Performance evaluation Parallel Systems Fault tolerance 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Computational Sciences and Engineering DivisionOak Ridge National LaboratoryOak RidgeUSA

Personalised recommendations