Article

Free access

Analysis of timing-based mutual exclusion with random times

Authors:

Eli Gafni,

Michael MitzenmacherAuthors Info & Claims

PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing

Pages 13 - 21

https://doi.org/10.1145/301308.301318

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

D. Attanasio, M. Butrico, J. Peterson, C. Polyzois, and S. Smith. Design and Implementation of a Recoverable Virtual Shared Disk, IBM Research Report, in preparation.

Google Scholar

[2]

P. Cao, S. B. Lira, S. Venkatarman, and J. Wilkes. The TickerTAIP Parallel RAID Architecture. ACM ~nsactions on Computer Systems, 12(3):236-267, Aug. 1994.

Digital Library

Google Scholar

[3]

M. Fischer. Personal communication from {91.

Google Scholar

[4]

L. Goldberg. Contention resolution notes. Available at http: //m~. dcs. ~arvick. ac. uk/~leslie/contention, html.

Google Scholar

[5]

L. Goldberg and P. MacKenzie. Analysis of Backoff Protocols for Contention Resolution with Multiple Servers. In Proceedings of the 7th Annual A CM-SIAM Symposium on Discrete Algorithms, pages 554-563, Atlanta, 1996.

Digital Library

Google Scholar

[6]

L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1-11, Feb. 1987.

Digital Library

Google Scholar

[7]

E. K. Lee and C. A. Thekkath. Petal: Distributed Virtual Disks. Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems, pages 84-92, Oct. 1996.

Digital Library

Google Scholar

[8]

B. Liskov. Practical Uses of Synchronized Clocks in Distributed Systems. Distributed Computing, 6: 211- 219, 1993.

Digital Library

Google Scholar

[9]

N. Lynch and N. Shavit. Timing Based Mutual Exclusion. In Proceedings of the Annual Real-Time Symposium (RTSS), Phoenix, pages 2-11, December 1992.

Crossref

Google Scholar

[10]

P. Raghavan and E. Upfal. Stochastic Contention Resolution with Short Delays. In Proceedings of the ~Tth ACId Symposium on the Theory of Computing, pages 229-237, 1995.

Digital Library

Google Scholar

[11]

C. A. Thekkath, T. Mann, and E. K. Lee. Frangipani: A Scalable Distributed File System. Proceedings of the ACM Symposium on Operating Systems Principles, pages 224-237, Dec. 1997.

Digital Library

Google Scholar

Cited By

View all

Baier CEngel BKlüppelholz SMärcker STews HVölp M(2013)A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-SelectNASA Formal Methods10.1007/978-3-642-38088-4_21(307-321)Online publication date: 2013
https://doi.org/10.1007/978-3-642-38088-4_21
Earle CFredlund L(2012)Verification of timed erlang programs using mcerlangProceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems10.1007/978-3-642-30793-5_16(251-267)Online publication date: 13-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30793-5_16
Chockler GMalkhi D(2006)Light-weight leases for storage-centric coordinationInternational Journal of Parallel Programming10.1007/s10766-006-0008-z34:2(143-170)Online publication date: 1-Apr-2006
https://dl.acm.org/doi/10.1007/s10766-006-0008-z
Show More Cited By

Index Terms

Recommendations

Analysis of Timing-Based Mutual Exclusion with Random Times

Various timing-based mutual exclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorithms behave when the time for the basic operations is governed by ...
Fair group mutual exclusion
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing

In the group mutual exclusion problem [6], which generalizes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If ...
Space-efficient FCFS group mutual exclusion

In the group mutual exclusion problem [Y. Joung, Asynchronous group mutual exclusion, Distrib. Comput. 13 (2000) 189], which generalizes mutual exclusion [E. Dijkstra, Solution of a problem in concurrent programming control, Comm. ACM 8 (9) (1965) 569], ...

Comments

Information & Contributors

Information

Published In

PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing

May 1999

286 pages

ISBN:1581130996

DOI:10.1145/301308

Chairmen:
Brian Coan
Bellcore, Morristown, NJ
,
Jennifer Welch
Texas A & M Univ., College Station

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC99

Sponsor:

PODC99: ACM Symposium on Principles of Distributed Computing

May 4 - 6, 1999

Georgia, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
309
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)4

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Baier CEngel BKlüppelholz SMärcker STews HVölp M(2013)A Probabilistic Quantitative Analysis of Probabilistic-Write/Copy-SelectNASA Formal Methods10.1007/978-3-642-38088-4_21(307-321)Online publication date: 2013
https://doi.org/10.1007/978-3-642-38088-4_21
Earle CFredlund L(2012)Verification of timed erlang programs using mcerlangProceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems10.1007/978-3-642-30793-5_16(251-267)Online publication date: 13-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30793-5_16
Chockler GMalkhi D(2006)Light-weight leases for storage-centric coordinationInternational Journal of Parallel Programming10.1007/s10766-006-0008-z34:2(143-170)Online publication date: 1-Apr-2006
https://dl.acm.org/doi/10.1007/s10766-006-0008-z
Fich FLuchangco VMoir MShavit N(2005)Obstruction-Free algorithms can be practically wait-freeProceedings of the 19th international conference on Distributed Computing10.1007/11561927_8(78-92)Online publication date: 26-Sep-2005
https://dl.acm.org/doi/10.1007/11561927_8
Anderson JKim YHerman T(2003)Shared-memory mutual exclusionDistributed Computing10.1007/s00446-003-0088-616:2-3(75-110)Online publication date: 1-Sep-2003
https://dl.acm.org/doi/10.1007/s00446-003-0088-6
Aspnes J(2002)Fast deterministic consensus in a noisy environmentJournal of Algorithms10.1016/S0196-6774(02)00220-145:1(16-39)Online publication date: 1-Oct-2002
https://dl.acm.org/doi/10.1016/S0196-6774%2802%2900220-1
Aspnes JNeiger G(2000)Fast deterministic consensus in a noisy environmentProceedings of the nineteenth annual ACM symposium on Principles of distributed computing10.1145/343477.343631(299-308)Online publication date: 16-Jul-2000
https://dl.acm.org/doi/10.1145/343477.343631

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations