How hard is it to take a snapshot? (English) Zbl 1117.68320
Vojtáš, Peter (ed.) et al., SOFSEM 2005: Theory and practice of computer science. 31st conference on current trends in theory and practice of computer science, Liptovský Ján, Slovakia, January 22–28, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24302-X/pbk). Lecture Notes in Computer Science 3381, 28-37 (2005).
Summary: The snapshot object is an important and well-studied primitive in distributed computing. This paper presents some implementations of snapshots from registers, in both asycnhronous and synchronous systems, and discusses known lower bounds on the time and space complexity of this problem.
For the entire collection see [Zbl 1069.68013].
For the entire collection see [Zbl 1069.68013].
MSC:
| 68M14 | Distributed systems |
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
