See applications run and throughput jump: The case for redundant computing in HPC
- Resource Type
- Conference
- Authors
- Riesen, Rolf; Ferreira, Kurt; Stearley, Jon
- Source
- 2010 International Conference on Dependable Systems and Networks Workshops (DSN-W) Dependable Systems and Networks Workshops (DSN-W), 2010 International Conference on. :29-34 Jun, 2010
- Subject
- Computing and Processing
Communication, Networking and Broadcast Technologies
Throughput
Laboratories
Circuit faults
Large-scale systems
Application software
Computer networks
Concurrent computing
Frequency
Costs
Resumes
- Language
- ISSN
- 2325-6648
2325-6664
For future parallel-computing systems with as few as twenty-thousand nodes we propose redundant computing to reduce the number of application interrupts. The frequency of faults in exascale systems will be so high that traditional checkpoint/restart methods will break down. Applications will experience interruptions so often that they will spend more time restarting and recovering lost work, than computing the solution. We show that redundant computation at large scale can be cost effective and allows applications to complete their work in significantly less wall-clock time. On truly large systems, redundant computing can increase system throughput by an order of magnitude.