|Title:|| ON THE MEMORY OVERHEAD
OF DISTRIBUTED SNAPSHOTS.
|Authors:|| L. Shabtay and A. Segall
This paper shows that the memory overhead of distributed snapshots is unbounded. Several techniques are suggested for bounding it: bounded memory-overhead versions of distributed snapshots for specific problems, like termination detection and deadlock detection; use of alternative protocols; or use of synchronizers or schedulers in order to limit the photographed protocol to executions whose distributed snapshot requires bounded memory. Each solution is discussed in detail, and its memory overhead is analyzed.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1993/LPCR/LPCR9322), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the LPCR technical reports of 1993
To the main CS technical reports page
Computer science department, Technion