Abstract
The topic of the paper is managing a fault-tolerant critical section in a completely asynchronous distributed network. Assume that processors may fail while using the critical section and therefore the critical section must have at least t+1 slots. (t is the maximum number of possible faulty processors).
There are several possibilities for defining a priority rule that achieves fairness among the processors. In [FLBB] processor p has a higher priority than processor q if p asked to access the critical section “before” q. In [ABDKPR] p has a higher priority than q if p used the critical section less than q. The drawback of the first rule (that motivated the second rule) is that a “fast” processor could use the critical section much more than a “slow processor”. The drawback of the second rule is that processors should use the critical section infinitely often in order to prevent deadlock. In this paper we modify the second rule to circumvent this last drawback. Processor p has higher priority than processor q only if p used the critical section less times than q, p wants to access the critical section and q “knows” this fact.
We present two algorithms which require t+1 and 2t+1 slots respectively. The second is a modification of the first which trades extra slots for simplicity and overcomes Byzantine faults as well.
Supported in part by a Weizmann fellowship, by contract ONR N00014-88-K-0166 and by a grant of Stanford's Center for Integrated Systems.
Part of this work was carried out while this author was visiting Stanford university. Supported in part by a Weizmann fellowship, by contract ONR N00014-88-K-0166 and by a grant of Stanford Center for Integrated Systems.
Preview
Unable to display preview. Download preview PDF.
References
H. Attiya, A. Bar-Noy, D. Dolev D. Koller, D. Peleg, and R. Reischuk, Achievable Cases in an Asynchronous Environment, Proc. 28th Symp. on Foundations of Comp. Science, pp. 196–203, 1987.
O. Biran, S. Moran, and S. Zaks, A Combinatorial Characterization of the Distributed Tasks which are Solvable in the Presence of One Faulty Processor, Proc. 7rd ACM Symp. of Principles of Dist. Computing, pp. 263–273, 1988.
M. F. Bridgland, and R. J. Watro, Fault-Tolerant Decision Making in Totally Asynchronous Distributed Systems, Proc. 6rd ACM Symp. of Principles of Dist. Computing, pp. 52–63, 1987.
D. Dolev, C. Dwork and L. Stockmeyer, On the Minimal Synchronism Needed for Distributed Consensus, Journal of the ACM, 34 pp. 77–97, 1987.
D. Dolev, E. Gafni, and N. Shavit, Toward a Non-Atomic Era: L-Exclusion as a Test Case, Proc. 19th ACM SIGACT Symposium on Theory of Computing, pp. 78–92, 1988.
D. Dolev, N. A. Lynch, S. Pinter, E. Stark, and W. E. Weihl, Reaching Approximate Agreement in the Presence of Faults, Journal of the ACM, 33 pp. 499–516, 1986.
M.J. Fischer, N.A. Lynch, J. E. Burns, and A. Borodin, Resource Allocation with Immunity to Limited Process Failure, Proc. 20th Symp. on Foundations of Comp. Science, pp. 234–254, 1979.
M.J. Fischer, N.A. Lynch, M.S. Paterson, Impossibility of Distributed Consensus with one Faulty Processor, Journal of the ACM, Vol. 32, No. 2, April 1985, pp. 374–382.
D. Koller, Token Survival: Resilient Token Algorithms, M.Sc. Thesis, Hebrew University, 1986.
J. L. Peterson, and A. Silberschatz, Operating Systems Concepts, 2nd Edition, Addison-Wesley Publishing Co., 1985, Ch. 8,9,13.
M. Raynal, Algorithms for Mutual Exclusion, North Oxford Academic Publishers Ltd, 1986.
L. S. Rudolph, Software Structures for Ultra Parallel Computing, Ph.D. Dissertation, Courant Institute, New York University, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar-Noy, A., Dolev, D., Koller, D., Peleg, D. (1989). Fault-tolerant critical section management in asynchronous networks. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_28
Download citation
DOI: https://doi.org/10.1007/3-540-51687-5_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51687-3
Online ISBN: 978-3-540-46750-2
eBook Packages: Springer Book Archive