article

Free access

Scalable reader-writer synchronization for shared-memory multiprocessors

Authors:

John M. Mellor-Crummey and

Michael L. ScottAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 7

Pages 106 - 113

https://doi.org/10.1145/109626.109637

Published: 01 April 1991 Publication History

PDF eReader

References

[1]

A. Agarwal and M. Cherian. Adaptive backoff synchronization techniques. In Proceedings of the International Symposium on Computer Architecture, pages 396-406, May 1989.

Digital Library

Google Scholar

[2]

T. E. Anderson. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1 ):6-16, Jan. 1990.

Digital Library

Google Scholar

[3]

P. J. Courtois, F. Heymans, and D. L. Pumas. Concurrent control with 'readers' and 'writers'. Communications of the ACM, 14(10):667-668, Oct. 1971.

Digital Library

Google Scholar

[4]

H. Davis and 3. Hennessy. Characterizing the synchronization behavior of parallel programs. In Proceedings of the A CM Conlerence on Parallel Programming: Experience with Applications, Languages and Systems, pages 198-211, July 1988.

Digital Library

Google Scholar

[5]

G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. Computer, 23(6):60-69, June 1990.

Digital Library

Google Scholar

[6]

M. Herlihy. A methodology for implementing highly concurrent data structures. In Proceedings o/the Second A GM Symposium on Principles and Practice of Parallel Programming, pages 197-206, Mar. 1990.

Digital Library

Google Scholar

[7]

C. P. Kruskal, L. Rudolph, and M. Snir. Efficient synchronization on multiprocessors with shared memory. In Proceedings of the Fifth A CM Symposium on Principles of Distributed Computing, pages 218-228, 1986.

Digital Library

Google Scholar

[8]

L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the A CM, 17(8):453-455, Aug. 1974.

Digital Library

Google Scholar

[9]

j. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. A GM Transactions on Computer Systems, to appear. Earlier version published as TR 342, Computer Science Department, University of Rochester, April 1990, and COMP TR90-114, Department of Computer Science, Rice University, May 1990.

Digital Library

Google Scholar

[10]

G. F. Pfister and V. A. Norton. "Hot spot" contention and combining in multistage interconnection networks. IEEE Transactions on Computers, C-34(10):943-948, Oct. 1985.

Crossref

Google Scholar

Cited By

View all

Li TChandramouli BMadden S(2024)Performant almost-latch-free data structures using epoch protection in more depthThe VLDB Journal10.1007/s00778-024-00859-8Online publication date: 17-Jun-2024
https://doi.org/10.1007/s00778-024-00859-8
Foughali MHladik PZuepke A(2023)Compositional verification of embedded real-time systemsJournal of Systems Architecture10.1016/j.sysarc.2023.102928142(102928)Online publication date: Sep-2023
https://doi.org/10.1016/j.sysarc.2023.102928
Brandenburg B(2022)Multiprocessor Real-Time Locking ProtocolsHandbook of Real-Time Computing10.1007/978-981-287-251-7_10(347-446)Online publication date: 9-Aug-2022
https://doi.org/10.1007/978-981-287-251-7_10
Show More Cited By

Index Terms

Scalable reader-writer synchronization for shared-memory multiprocessors

Recommendations

Scalable reader-writer locks
SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers attempt to acquire the lock concurrently, even though they are all allowed ...
Read More
Algorithms for scalable synchronization on shared-memory multiprocessors

Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, ...
Read More
Speculative Locks for Concurrent Execution of Critical Sections in Shared-Memory Multiprocessors
Read More

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 7

July 1991

223 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/109626

Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA

Issue’s Table of Contents

PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
April 1991
223 pages
ISBN:0897913906
DOI:10.1145/109625
Chairman:
David S. Wise
Indiana Univ., Bloomington

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 April 1991

Published in SIGPLAN Volume 26, Issue 7

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

100
Total Citations
View Citations
1,194
Total Downloads

Downloads (Last 12 months)136
Downloads (Last 6 weeks)20

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li TChandramouli BMadden S(2024)Performant almost-latch-free data structures using epoch protection in more depthThe VLDB Journal10.1007/s00778-024-00859-8Online publication date: 17-Jun-2024
https://doi.org/10.1007/s00778-024-00859-8
Foughali MHladik PZuepke A(2023)Compositional verification of embedded real-time systemsJournal of Systems Architecture10.1016/j.sysarc.2023.102928142(102928)Online publication date: Sep-2023
https://doi.org/10.1016/j.sysarc.2023.102928
Brandenburg B(2022)Multiprocessor Real-Time Locking ProtocolsHandbook of Real-Time Computing10.1007/978-981-287-251-7_10(347-446)Online publication date: 9-Aug-2022
https://doi.org/10.1007/978-981-287-251-7_10
Larus JRajwar RLarus JRajwar R(2022)Programming Transactional MemoryTransactional Memory10.1007/978-3-031-01719-3_2(15-52)Online publication date: 17-Oct-2022
https://doi.org/10.1007/978-3-031-01719-3_2
S SN AK SYadav MSajeev G(2021)A Scalable Algorithm for Readers-Writers Problem2021 5th International Conference on Trends in Electronics and Informatics (ICOEI)10.1109/ICOEI51242.2021.9453096(1722-1726)Online publication date: 3-Jun-2021
https://doi.org/10.1109/ICOEI51242.2021.9453096
Tanabe THoshino TKawashima HTatebe O(2020)An analysis of concurrency control protocols for in-memory databases with CCBenchProceedings of the VLDB Endowment10.14778/3424573.342457513:13(3531-3544)Online publication date: 27-Oct-2020
https://dl.acm.org/doi/10.14778/3424573.3424575
Brandenburg B(2019)Multiprocessor Real-Time Locking ProtocolsHandbook of Real-Time Computing10.1007/978-981-4585-87-3_10-1(1-99)Online publication date: 15-Nov-2019
https://doi.org/10.1007/978-981-4585-87-3_10-1
Gerstenberger RBesta MHoefler T(2018)Enabling highly scalable remote memory access programming with MPI-3 one sidedCommunications of the ACM10.1145/326441361:10(106-113)Online publication date: 26-Sep-2018
https://dl.acm.org/doi/10.1145/3264413
Roghanchi SEriksson JBasu N(2017)ffwdProceedings of the 26th Symposium on Operating Systems Principles10.1145/3132747.3132771(342-358)Online publication date: 14-Oct-2017
https://dl.acm.org/doi/10.1145/3132747.3132771
Shun J(2017)Shared-Memory Parallelism Can Be Simple, Fast, and Scalable10.1145/3018787Online publication date: 9-Jun-2017
https://doi.org/10.1145/3018787
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.

References

Cited By

Index Terms

Recommendations

Scalable reader-writer locks

Algorithms for scalable synchronization on shared-memory multiprocessors

Speculative Locks for Concurrent Execution of Critical Sections in Shared-Memory Multiprocessors

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

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