Article

Free access

Impossibility and universality results for wait-free synchronization

Author:

Maurice P. HerlihyAuthors Info & Claims

PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing

Pages 276 - 290

https://doi.org/10.1145/62546.62593

Published: 01 January 1988 Publication History

PDF eReader

References

[1]

K. Abmh:unson. On achieving consensus using a shared memory. Seventh ACM S|GACT-SIGOP$ Symposium on Principles of Distributed Computing (PODC), Aug., 1988. To appear.

Digital Library

Google Scholar

[2]

J,H. Anderson and M.G. Gouda. The Virtue of Patience: Concurrent Programming With and Without Waiting. Private Communication.

Google Scholar

[3]

B. Bloom. Constructing lwo-wdter atomic registers. Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, 1987, pp. 249-259.

Digital Library

Google Scholar

[4]

J.E. Burns and G.L. Peterson. Conaructing Multi-reader atomic values from non-atomic values. Proceedings of the Sixth ACM Symposium on Principles of Distributed Computhlg, 1987, pp. 222-231.

Digital Library

Google Scholar

[5]

B, C'hor, A. Israeli, and M, Li, On processor coordination using asynchronous hardware, Proceedings of the Sixth ACM Sympo,~ium on Principles of Distlibuted Computing, 1987. pp. 86-97.

Digital Library

Google Scholar

[6]

D. Dolev, C. Dwork, and L Stockmeyer. "On the milfimal synchronism needed for distributed consensus ". J. ACM 34, 1 (Jan. 1987), 77-97.

Digital Library

Google Scholar

[7]

M. Fisher, N.A. Lynch. and M.S. Paterson. "Impossibility of distributed commit with one faulty process". J. ACM 32, 2 (April 1985).

Digital Library

Google Scholar

[8]

A. Gottlieb, B.D. Lubaehevsky, and L. Rudolph. "Basic Techvtiques For the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors". ACM Trans. on Programming Lang. and Systems 5, 2 (April 1983), 164-189.

Digital Library

Google Scholar

[9]

A. Gottlieb, R. Od.~unan, C.P. Kruskal, K.P. McAuliffe, L. Rudolph, and M. Snir. "The NYU l.Jltracomputer-- Designing an MIMD parallel computer". IEEE Transactions on Computers C-32, 2 ~Feb. 1984), 175-189,

Google Scholar

[10]

M.P. Herlihy and J.M. Wing. Axioms for concurrent objects. 14th ACM Symposium on Principles of Programruing Languages, Jan., 1987, pp. 13-26.

Digital Library

Google Scholar

[11]

W.D, Hillis. The Connection Machine. The MIT Press, Cambridge, MA, 1985.

Digital Library

Google Scholar

[12]

C.P. Kruskal0 L. Rudolph, and M, Snir. Efficient Synchronization on Multiprocessors with Shared Memory. Fifth ACM S|GACT-SIGOPS Symposium on Principles of Distributed Computing, Aug., 1986.

Digital Library

Google Scholar

[13]

L. Lamport. "Concurrent Reading and Writing". Comm. ACM 20, 11 (Nov. 1977), 806-811.

Digital Library

Google Scholar

[14]

L. Lamport. "Flow to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs". IEEE Transactions on Computer~ C.28, 9 (September 1979), 6.90.

Google Scholar

[15]

L. Lamport. "Specifying Concurrent Program Modules". ACM Trans. on Progranmting Lan8. and Systems 5, 2 (April 1983), I90-222.

Digital Library

Google Scholar

[16]

L. Lamport. "On interprocess Communication, Parts I and 1I". Distributed Computing I (1986), 77-101.

Crossref

Google Scholar

[17]

V. Lanin and D. Shasha. Coneur~nt set manipulation without locking. Proceedings of the Seventh ACM Symposium on Principles of Database Systems, March, 1988, pp. 211-220.

Digital Library

Google Scholar

[18]

M.C. Loui and I4.1-i. Abu-Amara. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. In Advances in Computing Research, JAI Press, 1987, pp. 163-183.

Google Scholar

[19]

N.A. Lynch and M. Merrill. Introduction to the Theory of Nested Transactions. Tech. Rept. MIT/LCS/IR-387, M{T Lab. for Computer Science, April, 1986.

Digital Library

Google Scholar

[20]

N.A. Lynch and M.R. "Futile. Hierarchical Correctness Proofs for Distributed Algorithms. Tech. Rept. MIT/LCS/TR-387, MIT Lab. for Computer Science, April, 1987.

Digital Library

Google Scholar

[21]

R. Newman-Wolfe. A Protocol for wait-free, atomic, multi-reader shared variables. Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, 1987, pp. 232-249.

Digital Library

Google Scholar

[22]

C.H. Papadimitriou. "The Sefializability of Concurrent Database Updates". journal of the ACM 26, 4 (Oct. 1979), 631-653.

Digital Library

Google Scholar

[23]

G.L. Peterson. "Concurrent reading while writing". ACM Trans. on Programming Lang. and Systems 5, 1 (Jan. 1983), 46-55.

Digital Library

Google Scholar

[24]

G.L. Peterson and J.E. Burns. Concurrent reading while writing ii: the multi-writer case. Tech. Rept. GIT-ICS-86/26, Georgia Institute of Technology, Dec. 1986,

Google Scholar

[25]

G.H. Pfi~er et al. The IBM re.arch parallel processor prototype (RP3): introduction and architecture, lntematiortal Conference on Pasallel Processing. 1985.

Google Scholar

[26]

C.L. Seitz. "The Cosmic Cube". Comm. ACM 28, 1 (Jan. 1985).

Digital Library

Google Scholar

[27]

A.K. Singh, J.H. Anderson, and M.G. Gouda. The elusive atomic register revisited. Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, 1987", pp. 206-221.

Digital Library

Google Scholar

[28]

H.S. Stone. "Database applications of file FEIL~-AND- ADD instruction". IEEE Transactions on Computers C-33, 7 (July 1984), 604-612.

Digital Library

Google Scholar

[29]

P. Vitanyi and B. Awerbuch. Atomic Shared Register Access by Asynchronous Hardware. Proceedings of of tile 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 223-243. See also errata in SIGACT Hews 18(4), Summer. 1987.

Google Scholar

Cited By

View all

Coccimiglio GBrown TRavi SAgrawal KLee I(2022)PREP-UCProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538568(217-229)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538568
Rani RMahato D(2022)A randomized algorithm for the wait-free consensus problemThe Journal of Supercomputing10.1007/s11227-022-04774-z79:4(3666-3690)Online publication date: 7-Sep-2022
https://doi.org/10.1007/s11227-022-04774-z
Girondi MChiesa MBarbette T(2021)High-speed Connection Tracking in Modern Servers2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR52026.2021.9481841(1-8)Online publication date: 7-Jun-2021
https://doi.org/10.1109/HPSR52026.2021.9481841
Show More Cited By

Index Terms

Recommendations

Wait-free synchronization

A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free ...
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 ...

Comments

Information & Contributors

Information

Published In

PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing

January 1988

303 pages

ISBN:0897912772

DOI:10.1145/62546

Chairman:
Danny Dolev
Hebrew Univ., Jerusalem

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 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC88

Sponsor:

PODC88: The seventh annual conference on Principles of distributed computing

August 15 - 17, 1988

Ontario, Toronto, Canada

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

114
Total Citations
View Citations
2,006
Total Downloads

Downloads (Last 12 months)122
Downloads (Last 6 weeks)15

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Coccimiglio GBrown TRavi SAgrawal KLee I(2022)PREP-UCProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538568(217-229)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538568
Rani RMahato D(2022)A randomized algorithm for the wait-free consensus problemThe Journal of Supercomputing10.1007/s11227-022-04774-z79:4(3666-3690)Online publication date: 7-Sep-2022
https://doi.org/10.1007/s11227-022-04774-z
Girondi MChiesa MBarbette T(2021)High-speed Connection Tracking in Modern Servers2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR52026.2021.9481841(1-8)Online publication date: 7-Jun-2021
https://doi.org/10.1109/HPSR52026.2021.9481841
Garza AParra CScherson I(2021)Non-Blocking Technique for Parallel Algorithms with Global Barrier Synchronization2021 International Conference on Computational Science and Computational Intelligence (CSCI)10.1109/CSCI54926.2021.00334(1759-1764)Online publication date: Dec-2021
https://doi.org/10.1109/CSCI54926.2021.00334
Goubault ÉLedent JRajsbaum S(2020)A simplicial complex model for dynamic epistemic logic to study distributed task computabilityInformation and Computation10.1016/j.ic.2020.104597(104597)Online publication date: Jun-2020
https://doi.org/10.1016/j.ic.2020.104597
Jahić JAli KChatrangoon MJahani N(2019)(Dis)Advantages of Lock-free Synchronization Mechanisms for Multicore Embedded SystemsWorkshop Proceedings of the 48th International Conference on Parallel Processing10.1145/3339186.3339191(1-8)Online publication date: 5-Aug-2019
https://dl.acm.org/doi/10.1145/3339186.3339191
Ianni MPellegrini AQuaglia F(2019)Anonymous Readers CountingIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.286593230:2(286-299)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1109/TPDS.2018.2865932
Goubault ÉLedent JRajsbaum S(2018)A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task ComputabilityElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.277.6277(73-87)Online publication date: 7-Sep-2018
https://doi.org/10.4204/EPTCS.277.6
Kumar ABlelloch GHarper R(2017)Parallel functional arraysACM SIGPLAN Notices10.1145/3093333.300986952:1(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009869
Kumar ABlelloch GHarper RCastagna GGordon A(2017)Parallel functional arraysProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009869(706-718)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009869
Show More Cited By

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

Wait-free synchronization

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

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