Back to search

Georgia Institute of Technology

Designing and Automating Asynchronous, Localized, Multi-Level Fault-Tolerance at the Application Level

Abstract

dc:description.abstract

Moore’s law is dead or dying, but demand for compute continues to grow faster each year. The hardware scaling trends that have driven the growth of HPC are tapering off, which is forcing the industry to explore new approaches to continue scaling. Further, there is a growing public concern about the environmental impact of extreme-scale computing. Consequently, researchers in the cloud computing, machine learning, and embedded computing areas are exploring reduced-reliability computing as a means to improve both performance and efficiency. In HPC, however, the current Global Checkpoint/Recovery (GCR) approach to dealing with reduced hardware reliability is fundamentally unscalable. The costs of GCR are rising faster than the performance of leading supercomputers. It is critical for application resilience to scale with, rather than against, increasing hardware fault rates if HPC is to continue scaling while reigning in its environmental footprint. To avoid the exponential scaling of GCR, applications must localize the cost of hardware faults, which requires several changes in the traditional approach to fault tolerance. First, fault tolerance must be flexible to application-specific refinements while managing application developers’ reticence to implement complex resilience code. We describe a layer-based resilience taxonomy and approach that exposes the imperative configurability mechanisms to make fault-tolerance tools that can flexibly combine to utilize general application- and platform-tailored fault recovery. We demonstrate this by extending contemporary resilience tools to enable flexible and simple online recovery into applications with a multi-layered approach. Next, we define the key properties of localized recovery by creating a general analytical model. We demonstrate a pseudo-local approach using modern ULFM MPI features and show high scalability despite ULFM’s collective nature. Finally, we design a task-based recovery model capable of extending pseudo-locality to applications which do not fit the ideal model. These works build the path for HPC to maintain environmental accountability, meet growing compute demands, and benefit from novel upcoming hardware trends.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Computer Science
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Whitlock, Matthew J.
Advisor dc:contributor.advisor
  • Sarkar, Vivek
Committee members dc:contributor.committeemember
  • Gavrilovska, Ada
  • Teranishi, Keita
  • Conte, Tom
  • Ramachandran, Umakishore

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1853/77831

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Whitlock, Matthew J.. Designing and Automating Asynchronous, Localized, Multi-Level Fault-Tolerance at the Application Level. Doctoral thesis, Georgia Institute of Technology, 2025. https://hdl.handle.net/1853/77831