Newman-Wolfe, R. E. {'86a}, "Economical Atomic Multi-Reader Shared Registers," Proceedings of the 24th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, October 1986.

Google Scholar

[8]

Newman-Wolfe, a. E. {'86b}, "Communication issues in Parallel Computation," University of Rochester Computer Science Department, TR-200, December, 1986.

Google Scholar

[9]

Peterson, G. L.{'83a}, "Concurrent Reading While Writing," TOPLAS 5:1, 46-55, 1083.

Digital Library

Google Scholar

[10]

Peterson, G. L.{'83b}, "A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables," TOPLAS 5:1, 56- 65, 1983.

Digital Library

Google Scholar

[11]

Peterson, G. L. and J. E. Burns {'86}, "Concurrent Reading While Writing: the Multi-writer Case," TR GIT-ICS 86/26, School of Information and Computer Science, Georgia Institute of Technology, Dec. 1986.

Google Scholar

[12]

Vitanyi, P. and B. Awerbuch {'86}, "Atomic Shared Register Access by Asynchronous Hardware," Proceedings of the 27th FOGS, 233-243, 1086.

Digital Library

Google Scholar

Cited By

View all

Hu XToueg S(2024)On implementing SWMR registers from SWSR registers in systems with Byzantine failuresDistributed Computing10.1007/s00446-024-00465-537:2(145-175)Online publication date: 6-Jun-2024
https://doi.org/10.1007/s00446-024-00465-5
Pasetto DMeneghin MFranke HPetrini FXenidis JEpema DKielmann TRipeanu M(2012)Performance evaluation of interthread communicationmechanisms on multicore/multithreaded architecturesProceedings of the 21st international symposium on High-Performance Parallel and Distributed Computing10.1145/2287076.2287098(131-132)Online publication date: 18-Jun-2012
https://dl.acm.org/doi/10.1145/2287076.2287098
Larsson AGidenstam AHa PPapatriantafilou MTsigas P(2009)Multiword atomic read/write registers on multiprocessor systemsACM Journal of Experimental Algorithmics10.1145/1412228.145526213(1.7-1.30)Online publication date: 23-Feb-2009
https://dl.acm.org/doi/10.1145/1412228.1455262
Show More Cited By

Index Terms

A protocol for wait-free, atomic, multi-reader shared variables
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Mutual exclusion
    2. Software system structures
      1. Distributed systems organizing principles

Recommendations

A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol Complexes

In the atomic snapshot system model, the processes of an asynchronous distributed system communicate by atomic write and atomic snapshot read operations on a shared memory consisting of single-writer multiple-reader registers. The processes may fail by ...
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 '87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing

December 1987

304 pages

ISBN:089791239X

DOI:10.1145/41840

Editor:
Fred B. Schneider

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 December 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC87

Sponsor:

PODC87: Sixth Annual ACM Symposium on Principles of Distributed Computing

August 10 - 12, 1987

British Columbia, Vancouver, Canada

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
473
Total Downloads

Downloads (Last 12 months)56
Downloads (Last 6 weeks)9

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hu XToueg S(2024)On implementing SWMR registers from SWSR registers in systems with Byzantine failuresDistributed Computing10.1007/s00446-024-00465-537:2(145-175)Online publication date: 6-Jun-2024
https://doi.org/10.1007/s00446-024-00465-5
Pasetto DMeneghin MFranke HPetrini FXenidis JEpema DKielmann TRipeanu M(2012)Performance evaluation of interthread communicationmechanisms on multicore/multithreaded architecturesProceedings of the 21st international symposium on High-Performance Parallel and Distributed Computing10.1145/2287076.2287098(131-132)Online publication date: 18-Jun-2012
https://dl.acm.org/doi/10.1145/2287076.2287098
Larsson AGidenstam AHa PPapatriantafilou MTsigas P(2009)Multiword atomic read/write registers on multiprocessor systemsACM Journal of Experimental Algorithmics10.1145/1412228.145526213(1.7-1.30)Online publication date: 23-Feb-2009
https://dl.acm.org/doi/10.1145/1412228.1455262
Haldar SVidyasankar K(2009)On space-optimality of buffer-based conflict-free constructions of 1-writer 1-reader multivalued atomic variables from safe bitsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2008.08.00569:1(20-27)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1016/j.jpdc.2008.08.005
Li MVitanyi P(2005)How to share concurrent asynchronous wait-free variablesAutomata, Languages and Programming10.1007/BFb0035779(488-505)Online publication date: 29-Nov-2005
https://doi.org/10.1007/BFb0035779
Jayanti P(2005)Wait-free computingDistributed Algorithms10.1007/BFb0022136(19-50)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0022136
Anderson JMoir M(2005)Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract)Distributed Algorithms10.1007/3-540-57271-6_26(39-53)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57271-6_26
Jayanti PToueg S(2005)Some results on the impossibility, universality, and decidability of consensusDistributed Algorithms10.1007/3-540-56188-9_5(69-84)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-56188-9_5
Chaudhuri SWelch J(2005)Bounds on the costs of register implementationsDistributed Algorithms10.1007/3-540-54099-7_27(402-421)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-54099-7_27
Kranakis E(2005)Functional dependencies of variables in wait-free programsDistributed Algorithms10.1007/3-540-51687-5_39(148-159)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-51687-5_39
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

A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol Complexes

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

A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol Complexes

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

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations