[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/75427.75451acmconferencesArticle/Chapter ViewAbstractPublication PagescscConference Proceedingsconference-collections
Article
Free access

Decentralized mutual exclusion in the presence of link failures

Published: 21 February 1989 Publication History

Abstract

A distributed algorithm for achieving mutual exclusion in a point-to-point network with lossy communication links is presented. A communication link is said to be lossy if it loses messages at will. The algorithm tolerates any number of lossy communication links, as long as the link failures do not partition the communication network. The message network is completely asynchronous and, hence, link failures are not detectable. In a network with n nodes and e links, the algorithm requires no more than 2e(2√n + 1) message transmissions per mutual exclusion request.

References

[1]
A. A. Albert and R. Sandier, An Introduction to Finite Projective Planes. Holt, Rinehart and Winston, New York, 1968.
[2]
E.W. Dijkstra, Solution of a problem in Concurrent Programming, CACM, 8(9) (Sept. 1965), 569.
[3]
M.J. Fischer, N.A. Lynch, and M.S. Paterson, Impossibility of Distributed Consensus with One Faulty Process, JACM, 32(2) (April 1985) 374-382.
[4]
T. V. Lakshman and A. K. Agrawala, Efficient Decentralized Consensus Protocols, IEEE Trans. Software Engineering, 12(5) (May 1986) 600-607.
[5]
L Lamport, A New Solution of Dijkstra's concurrent programming problem, CACM, 17(8) (Aug. 1974) 453-455.
[6]
L. Lamport, Time, Clocks and the Ordering of Events in a Distributed System, CACM, 21(7) (July 1978) 558-565.
[7]
L. Lamport, Using Time instead of Timeout for Fault-Tolerant Distributed Systems, ACM TOPLAS 6(2) (April 1984) 254-280.
[8]
L. Lamport, The Mutual Exclusion Problem: Part I - A Theory of Interprocess Communication, JACM, 33(2) (April 1986) 313-326.
[9]
L. Lamport, The Mutual Exclusion Problem: Part I - Statement and Solutions, JACM, 33(2) (April 1986) 313-326.
[10]
M. Maekawa, A qN- algorithm for mutual exclusion in decentralized systems, ACM Trans. Comput. Syst. 3(2) (May 1985) 145-159.
[11]
R. McCurley and F. B. Schneider, Derivation of A Distributed Algorithm for Finding Paths in Directed Networks, Science of Computer Programming, 6 (1986) 1-9.
[12]
G. Ricart and A. K. Agrawala, An Optimal Algorithm for Mutual Exclusion in Computer Networks, CACM, 24(1) (Jan. 1981) 9-17.
[13]
F.S. Roberts, Applied Combinatorics, Prentice-Hall, 1984.
[14]
B. Sanders, The Information Structure of Distributed Mutual Exclusion Algorithms, ACM Trans. Comput. Syst. 5(3) (Aug. 1987) 284-299.
[15]
F. B. Schneider, Synchronization in Distributed Programs, ACM TOPLAS, 4(2) (April 1982) 125- 148.

Cited By

View all
  • (2010)Reducing Coordinator Failures in Centralized Algorithm to Guarantee Mutual Exclusion Using a Backup SiteProceedings of the 2010 Second International Conference on Future Networks10.1109/ICFN.2010.45(124-128)Online publication date: 22-Jan-2010

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
CSC '89: Proceedings of the 17th conference on ACM Annual Computer Science Conference
February 1989
121 pages
ISBN:0897912993
DOI:10.1145/75427
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 February 1989

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

ICMI05
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)65
  • Downloads (Last 6 weeks)10
Reflects downloads up to 13 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2010)Reducing Coordinator Failures in Centralized Algorithm to Guarantee Mutual Exclusion Using a Backup SiteProceedings of the 2010 Second International Conference on Future Networks10.1109/ICFN.2010.45(124-128)Online publication date: 22-Jan-2010

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media