Abstract
A snapshot protocol derived from the Lay-Yang colouring algorithm [2] is presented. The special feature of this protocol is the use of system acknowledgement messages, already generated by most communication libraries, to detect snapshot termination. Formal definitions, demonstrations, message complexity (which is O(n) where n is the number of processes) as well as comparisons with other communication protocols are discussed in [1]. In the following we provide a short description of an implementation based on the PVM library.
This is a preview of subscription content, log in via an institution to check access.
References
Gianuzzi V.: An optimal snapshot protocol for acknowledged message passing. Tech. Rep. DISI-TR-96-6. submitted for publication (1996).
Lai T.-H., Yang T.-H.: On distributed snapshots. Inform. Process. Lett. 25 (1987) 153–258.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clematis, A., Gianuzzi, V., Sacchetto, G. (1996). Implementing snapshot protocol for message based communication libraries. In: Böszörményi, L. (eds) Parallel Computation. ACPC 1996. Lecture Notes in Computer Science, vol 1127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61695-0_23
Download citation
DOI: https://doi.org/10.1007/3-540-61695-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61695-5
Online ISBN: 978-3-540-70645-8
eBook Packages: Springer Book Archive