Abstract
We describe a reset subsystem that can be embedded in an arbitrary distributed system in order to allow the system processes to reset the system when necessary. The effect of each reset is to start the system in a global state that is reachable from a predefined state. Our reset subsystem has a number of nice features: it is modular, layered, self-stabilizing and can tolerate the failures and subsequent repairs of processes and channels. There are three main components in our design of the reset subsystem: a leader election, a spanning tree construction, and a diffusing computation. Each of these components is both self-stabilizing and tolerant of process and channel failures and repairs; thus, our design of each component is more robust than earlier designs of similar components.
(Extended Abstract)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Arora and M.G. Gouda, “Distributed Reset,” 1990, in preparation.
J.E. Burns, M.G. Gouda, and R.E. Miller, “On relaxing interleaving assumptions,” Technical Report GIT-ICS-88/29, School of ICS, Georgia Institute of Technology, 1988; also submitted for journal publication.
G.M. Brown, M.G. Gouda, and C.-L. Wu, “Token systems that self-stabilize,” IEEE Transactions on Computers, Vol. 38, No. 6 (1989), pp. 845–852.
J.E. Burns and J. Pachl, “Uniform self-stabilizing rings,” ACM Transactions on Programming Languages and Systems, Vol. 11, No. 2 (1989), pp. 330–344.
S. Dolev, A. Israeli, and S. Moran, “Self-stabilization of dynamic systems,” Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report Number STP-379-89.
E.W. Dijkstra, and C.S. Scholten, “Termination detection for diffusing computations,” Information Processing Letters, Vol. 11, No. 1 (1980), pp. 1–4.
S. Katz and K. Perry, “Self-stabilizing extensions for message-passing systems,” Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report Number STP-379-89.
M. Fischer, N. Lynch, and M. Paterson, “Impossibility of distributed consensus with one faulty process”, Journal of the ACM, Vol. 32, No. 2 (1985), pp. 374–382.
N. Francez, Fairness, Springer-Verlag, 1986.
L. Shrira and O. Goldreich, “Electing a leader in the presence of faults: A ring as a special case,” Acta Informatica, Vol. 24 (1987), pp. 79–91.
G. Taubenfeld, “Leader election in the presence of n − 1 initial failures”, Information Processing Letters, Vol. 33 (1989), pp. 25–28.
R.B. Yehuda and S. Kutten, “Fault tolerant distributed majority commitment”, Journal of Algorithms, Vol. 9 (1988), pp. 568–582.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arora, A., Gouda, M. (1990). Distributed reset. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_54
Download citation
DOI: https://doi.org/10.1007/3-540-53487-3_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53487-7
Online ISBN: 978-3-540-46313-9
eBook Packages: Springer Book Archive