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, enabling fault tolerance and system recovery.
155
Publications
8.6K
Citations
429
Authors
188
Institutions
Publications per year
2017–2026
20
Parents
Publications
155
K. Mani Chandy, Leslie Lamport · ACM Transactions on Computer Systems · 1985 · 2.4K citations · Full text
Immediate atomic snapshots and fast renaming
Elizabeth Borowsky, Eli Gafni · 1993 · 202 citations
1–5 of 155
Authors
429
- ER
5
h-index
- PF
5
h-index
- AD
5
h-index
- HA
4
h-index
- DT
4
h-index
1–5 of 429
Institutions
188
Technion – Israel Institute of Technology
Haifa, Israel
7 h-index
15 publications
447 citations
IBM (United States)
Armonk, United States
6 h-index
9 publications
337 citations
University of Ioannina
Ioannina, Greece
5 h-index
6 publications
77 citations
York University
Toronto, Canada
5 h-index
7 publications
171 citations
University of Toronto
Toronto, Canada
5 h-index
5 publications
67 citations
University of Illinois Chicago
Chicago, United States
4 h-index
5 publications
121 citations
Tel Aviv University
Tel Aviv, Israel
4 h-index
10 publications
321 citations
Virginia Tech
Blacksburg, United States
3 h-index
4 publications
85 citations
1–8 of 188
Venues
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 6 publications · 548 citations
6
h-index
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 4 publications · 105 citations
4
h-index
- arXiv (Cornell University)
Repository · 3 publications · 183 citations
3
h-index
- IEEE Transactions on Software Engineering
TSE · 2 publications · 93 citations
2
h-index
- Theoretical Computer Science
2 publications · 77 citations
2
h-index
1–5