|
ALGORITHM FOR DISTRIBUTED SYSTEMS
1
Author(s):
DEEPAK SISODIA
Vol - 4, Issue- 2 ,
Page(s) : 573 - 576
(2013 )
DOI : https://doi.org/10.32804/IRJMST
Abstract
In Synchronous snapshot collection algorithm a node initiates snapshot collection by taking its local snapshot then it sends request message to another nodes to take their snapshot. If the nodes maintain information about casual dependencies a minimal number of nodes have to take their local snapshots in response to such requests. Koo and Toueg had presented such an algorithm which involves suspending the underlying computation during snapshot collection .The nodes resume the underlying when the snapshot collection terminates .Koo and Toueg have proposed methods to handle concurrent initiations of snapshot collection.
- H. Attiya, C. Dwork, N. A. Lynch, L. Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. Journal of the ACM, 41:122142, 1994. 2001
- H. Attiya, J. Welch. Distributed Computing, Fundamentals, Simulations and Advanced Topics. McGraw-Hill, 1998.
- B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804823, 1985. 2001 [4] P. Berman, J. Garay. Cloture votes: n/4-resilient distributed consensus in t + 1 rounds. Mathematical Systems Theory, 26(1):319, 1993.
- J. E. Burns, N. A. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2):171184, 1993.
- D. Dolev, R. Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656666, 1983. 2017, 2018 [7] M. J. Fischer, N. A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183186, 1982.
|