Abstract
In this paper we study asynchronous networks, in which processors may fail and recover several times during an execution. Upon recovery a processor rejoins the execution as a passive processor, with all variables initialized, except for a fault flag, which is updated by the system. In addition to the regular communication links connecting pairs of processors, the processors are connected by a unidirectional ring of communication links, such that upon a failure of a processor all of the processor's incoming messages are transferred to the outgoing link belonging to this ring. We present a general transformation, that modifies any algorithm, that is designed for an ordinary fault-free asynchronous network, to run on such networks.
Work supported in part by grant 120-737 of the fund for the promotion of research at the Technion.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.Y. Chan and F.Y.L. Chin, Optimal resilient distributed algorithms for ring election, IEEE Transactions on Parallel and Distributed Systems, Vol. 4,No. 4, April 1993, 475–480.
Springer-VerlagE. Chang and R. Roberts, An improved algorithm for decentralized extrema-finding in circular configuration of processes, CACM 22,5, 1979, 281–283.
R.E. Filman and D.P. Friedman, Coordinated computing: tools and techniques for distributed software, McGraw-Hill 1984.
G. N. Frederickson and N. A. Lynch, Electing a leader in a synchronous ring, Journal of the ACM, No. 1, Vol. 34, 1987, 98–115.
R. G. Gallager, P. A. Humblet and P. M. Spira, A distributed algorithm for minimum spanning tree, Transactions on Programming Languages and Systems, 5, 1, 1983, 66–77.
O. Goldreich and L. Shrira, The effects of link failure on computations in asynchronous rings, Proc. of the ACM Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, August 1986, 174–185.
A. Itai, S. Kutten, Y. Wolfstahl and S. Zaks, Optimal distributed t-resilient election in complete networks, IEEE Transactions on Software Engineering, Vol. 16, No. 4, April 1990, 415–420.
E. Korach, S. Moran and S. Zaks, The Optimality of Distributed Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors, SIAM Journal on Computing, 16:2, 1987, 231–236.
G. LeLann, Distributed systems — towards a formal approach, Information Processing 77, Elsevier Science, New York 1977, 155–160.
M. Molcho and S. Zaks, Distributed algorithms for asynchronous networks with a fault detection ring, M.Sc. Thesis, Department of computer science, Technion, Haifa, Israel, February 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Molcho, M., Zaks, S. (1994). Robust asynchronous algorithms in networks with a fault detection ring. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_171
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive