Article

Free access

Lower bounds for wait-free computation in message-passing systems

Authors:

M. Herlihy,

Mark R. TuttleAuthors Info & Claims

PODC '90: Proceedings of the ninth annual ACM symposium on Principles of distributed computing

Pages 347 - 362

https://doi.org/10.1145/93385.93439

Published: 01 August 1990 Publication History

PDF eReader

References

[1]

H. Atfiya, A. Bar-Noy, D. Dolev, D. KoUer, D. Pcleg, and R. Reischuk. Achievable cases in an asynchronous environment. In Proceedings el the 28th IEEE Symposium on Foundations o/Computer Science, pages 337-346, October 1987.

Google Scholar

[2]

H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk. Renaming in an asynchronous environment. Journal of the A CM, July 1990.

Digital Library

Google Scholar

[3]

J.E. Burns and N.A. Lynch. The Byzantine firing squad problem. Advances in Computing Research: Parallel and Distributed Computing, 4:147--161, 1987. Available as Technical Report MIT/LCS/TM- 275, MIT Laboratory for Computer Science.

Google Scholar

[4]

J.E. Burns and G.L. Peterson. The ambiguity of choosing. In Proceedings of the 8t~ Annual A CM Symposium on Princples of Distributed Computing, pages 145-158, Edmonton, Alberta, August 1989.

Digital Library

Google Scholar

[5]

B. Coan, D. Dolev, C. Dwork, and L. Stockmeyer. The distributed firing squad problem. In Proceedings of the 17th A CM Symposium on Theory of Computing, pages 335-345, May 1985. Available as IBM Research Report RJ 5343, 1986.

Digital Library

Google Scholar

[6]

D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchrony needed for distributed consensus. Journal of the A CM, 34(1):77-97, January 1987.

Digital Library

Google Scholar

[7]

D. Dolev and H.R. Strong. Polynomial algorithms for multiple processor agreement. In Prec. l~th A CM Syrup. on Theory el Computing, pages 401-407, May 1982.

Crossref

Google Scholar

[8]

C. Dwork, N.A. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the A CM, 35(2):288-323; April 1988.

Digital Library

Google Scholar

[9]

C. Dwork and Y. Moses. Knowledge and common knowledge in a Byzantine environment I: crash failures (extended abstract). In Joseph Y. Halpern, editor, Theoretical Aspects of Reasoning about Knowledge: Proceedings oJ the 1986 Conference, pages 149- 170. Morgan Kaufmann, 1986. To appear in InJormation and Computation. Also available as MIT Technical Memo MIT/LCS/TM-300.

Digital Library

Google Scholar

[10]

M. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed commit with one faulty process. Journal of the A CM, 32(2), April 1985.

Digital Library

Google Scholar

[11]

M.J. Fischer and N.A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183-186, June 1982.

Crossref

Google Scholar

[12]

G.N. Frederickson and N.A. Lynch. Electing a leader in a synchronous ring. Journal o/the A CM, 34(1):98- 115, January 1987.

Digital Library

Google Scholar

[13]

M.P. Herlihy. A quorum-consensus replication method for abstract data types. ACM Transactions on Computer Systems, 4(1), February 1986.

Digital Library

Google Scholar

[14]

M.P. Herlihy. Impossibility and universality results for wait-free synchronization. In Seventh A CM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), August 1988.

Digital Library

Google Scholar

[15]

M.P. Herlihy and J.M. Wing. Axioms for concurrent objects. In l~th A CM Symposium on Principles of Programming Languages, pages 13-26, January 1987.

Digital Library

Google Scholar

[16]

C.P. Kruskal, L. Rudolph, and M. Snir. Efficient synchronization on multiprocessors with shared memory. In Fifth A CM SIGA CT-SIGOPS Sympoaium on Principles of Distributed Computing, August 1986.

Digital Library

Google Scholar

[17]

L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications el the A CM, 21(7):558-565, July 1978.

Digital Library

Google Scholar

[18]

L. Lamport. How to make a multiprocessor computer that correctly executes mu}tiprocess programs. IEEE Transactions on Computers, C-28(9):690, September 1979.

Digital Library

Google Scholar

[19]

L. Lamport. The part-time parliament. Technical Report 49, Digital Equipment Corporation, Systems Research Center, September 1989.

Google Scholar

[20]

C.H. Papadimitriou. The seria}izability of concurrent database updates. Journal o~ the A CM, 26(4):631- 653, October 1979.

Digital Library

Google Scholar

[21]

M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal o~ the ACM, 27(2):228-234, 1980.

Digital Library

Google Scholar

[22]

F.B. Schneider. implementing fault-tolerant services using the state machine approach: a tutorial. Technical report, Cornell Computer Science Dept., November 1987.

Google Scholar

[23]

E. Styer and G.L. Peterson. Tight bounds for shared memory symetric mutual exclusion problems, in Proceedings el the 8th Annual A CM Symposium on Principles o} Distributed Computing, pages 177-192, August 1989.

Digital Library

Google Scholar

[24]

M.R. Tuttle. Knowledge and Distributed Computation. PhD thesis, M.I.T., 1989.

Google Scholar

Cited By

View all

Herlihy MMoses YTuttle MGavoille CFraigniaud P(2011)Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutionsProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993849(231-238)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993806.1993849
Brodsky AEllen FWoelfel P(2011)Fully-adaptive algorithms for long-lived renamingDistributed Computing10.1007/s00446-011-0137-524:2(119-134)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1007/s00446-011-0137-5
Okun M(2010)Strong order-preserving renaming in the synchronous message passing modelTheoretical Computer Science10.1016/j.tcs.2010.06.001411:40-42(3787-3794)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.06.001
Show More Cited By

Index Terms

Lower bounds for wait-free computation in message-passing systems

Recommendations

Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies
ASPLOS '13

Transactional memory (TM) has been proposed to alleviate some key programmability problems in chip multiprocessors. Most TMs optimistically allow concurrent transactions, detecting read-write or write-write conflicts. Upon conflicts, existing hardware ...
Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies
ASPLOS '13

Transactional memory (TM) has been proposed to alleviate some key programmability problems in chip multiprocessors. Most TMs optimistically allow concurrent transactions, detecting read-write or write-write conflicts. Upon conflicts, existing hardware ...
Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies
ASPLOS '13: Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems

Transactional memory (TM) has been proposed to alleviate some key programmability problems in chip multiprocessors. Most TMs optimistically allow concurrent transactions, detecting read-write or write-write conflicts. Upon conflicts, existing hardware ...

Comments

Information & Contributors

Information

Published In

PODC '90: Proceedings of the ninth annual ACM symposium on Principles of distributed computing

August 1990

411 pages

ISBN:089791404X

DOI:10.1145/93385

Chairman:
Cynthia Dwork
Univ. of Montreal, Quebec, Canada

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 August 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC90

Sponsor:

PODC90: 9th Annual ACM Symposium in Principles of Distibuted Computing

August 22 - 24, 1990

Quebec, Quebec City, Canada

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
364
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)10

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Herlihy MMoses YTuttle MGavoille CFraigniaud P(2011)Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutionsProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993849(231-238)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993806.1993849
Brodsky AEllen FWoelfel P(2011)Fully-adaptive algorithms for long-lived renamingDistributed Computing10.1007/s00446-011-0137-524:2(119-134)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1007/s00446-011-0137-5
Okun M(2010)Strong order-preserving renaming in the synchronous message passing modelTheoretical Computer Science10.1016/j.tcs.2010.06.001411:40-42(3787-3794)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.06.001
Brodsky AEllen FWoelfel P(2006)Fully-adaptive algorithms for long-lived renamingProceedings of the 20th international conference on Distributed Computing10.1007/11864219_29(413-427)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.1007/11864219_29
Chaudhuri STuttle M(2005)Fast increment registersDistributed Algorithms10.1007/BFb0020425(74-88)Online publication date: 10-Jun-2005
https://doi.org/10.1007/BFb0020425
Attiya HDjerassi-Shintel T(2005)Time bounds for decision problems in the presence of timing uncertainty and failuresDistributed Algorithms10.1007/3-540-57271-6_37(204-218)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57271-6_37
Attiya HHerlihy MRachman O(2005)Efficient atomic snapshots using lattice agreementDistributed Algorithms10.1007/3-540-56188-9_3(35-53)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-56188-9_3
Herlihy MRajsbaum SAnderson J(1995)Algebraic spansProceedings of the fourteenth annual ACM symposium on Principles of distributed computing10.1145/224964.224975(90-99)Online publication date: 20-Aug-1995
https://dl.acm.org/doi/10.1145/224964.224975
Attiya HHerlihy MRachman O(1995)Atomic snapshots using lattice agreementDistributed Computing10.1007/BF022427148:3(121-132)Online publication date: 1-Mar-1995
https://dl.acm.org/doi/10.1007/BF02242714
Attiya HDwork CLynch NStockmeyer LKoutsougeras CVitter J(1991)Bounds on the time to reach agreement in the presence of timing uncertaintyProceedings of the twenty-third annual ACM symposium on Theory of Computing10.1145/103418.103457(359-369)Online publication date: 3-Jan-1991
https://dl.acm.org/doi/10.1145/103418.103457
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies

Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies

Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies

Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies

Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations