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
33
K. Mani Chandy, Leslie Lamport · ACM Transactions on Computer Systems · 1985 · 2.4K citations · Full text
Virtual Time and Global States of Distributed Systems
Friedemann Mattern · 2002 · 1.3K citations
1–5 of 33
76
5
h-index
Institut de Recherche en Informatique et Systèmes Aléatoires, France
3 publications · 123 citations
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 76
42
IBM (United States)
Armonk, United States
4 h-index
7 publications
302 citations
University of Illinois Chicago
Chicago, United States
4 h-index
5 publications
121 citations
The University of Texas at Austin
Austin, United States
3 h-index
3 publications
2.5K citations
Institut de Recherche en Informatique et Systèmes Aléatoires
Rennes, France
2 h-index
6 publications
216 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
5 publications
73 citations
The Ohio State University
Columbus, United States
2 h-index
4 publications
222 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
5 publications
103 citations

York University
Toronto, Canada
2 h-index
2 publications
28 citations
1–8 of 42
TPDS · 5 publications · 355 citations
5
h-index
TSE · 3 publications · 161 citations
3
h-index
2 publications · 59 citations
2
h-index
2 publications · 409 citations
2
h-index
Repository · 1 publications · 17 citations
1
h-index
1–5