Checkpointing Optimization

Checkpointing Optimization is a data movement optimization technique that reduces computational redundancy and I/O overhead by selectively preserving and restoring intermediate program states at strategically determined execution points to minimize recovery time and resource consumption during fault tolerance in distributed computing environments.

193

Publications

8K

Citations

487

Authors

213

Institutions

Publications per year

2017–2026

35

Authors

487

  1. FC
    Franck Cappello

    Argonne National Laboratory, United States

    11 publications · 341 citations

    11

    h-index

  2. YR
    Yves Robert

    École Normale Supérieure de Lyon, France

    8 publications · 318 citations

    8

    h-index

  3. JS
    James S. Plank

    University of Tennessee at Knoxville, United States

    8 publications · 1.2K citations

    8

    h-index

  4. FV
    Frédéric Vivien

    École Normale Supérieure de Lyon, France

    5 publications · 267 citations

    5

    h-index

  5. NK
    Naoto Kaio

    Hiroshima University, Japan

    5 publications · 120 citations

    5

    h-index

1–5 of 487

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 677 citations

    8

    h-index

  2. IEEE Transactions on Computers

    7 publications · 564 citations

    7

    h-index

  3. Journal of Parallel and Distributed Computing

    3 publications · 129 citations

    3

    h-index

  4. arXiv (Cornell University)

    Repository · 3 publications · 35 citations

    3

    h-index

  5. IEEE Transactions on Software Engineering

    TSE · 3 publications · 71 citations

    3

    h-index

1–5