Distributed Snapshot Algorithms

Distributed Snapshot Algorithms is a class of distributed algorithms designed to capture a consistent global state of a distributed system by recording the local states of individual processes and the states of communication channels in a coordinated manner, enabling the analysis of system-wide properties such as termination or deadlock.

33

Publications

5.2K

Citations

76

Authors

42

Institutions

Publications per year

2017–2026

0

Authors

76

  1. AD
    Ajay D. Kshemkalyani

    University of Illinois Chicago, United States

    5 publications · 184 citations

    5

    h-index

  2. MR
    Michel Raynal

    Institut de Recherche en Informatique et Systèmes Aléatoires, France

    3 publications · 123 citations

    3

    h-index

  3. ER
    Eric Ruppert

    York University, Canada

    2 publications · 28 citations

    2

    h-index

  4. FM
    Friedemann Mattern

    ETH Zurich, Switzerland

    2 publications · 1.7K citations

    2

    h-index

  5. PF
    Panagiota Fatourou

    University of Crete, Greece

    2 publications · 28 citations

    2

    h-index

1–5 of 76

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 5 publications · 355 citations

    5

    h-index

  2. IEEE Transactions on Software Engineering

    TSE · 3 publications · 161 citations

    3

    h-index

  3. Information Processing Letters

    2 publications · 59 citations

    2

    h-index

  4. Journal of Parallel and Distributed Computing

    2 publications · 409 citations

    2

    h-index

  5. SMARTech Repository (Georgia Institute of Technology)

    Repository · 1 publications · 17 citations

    1

    h-index

1–5