article

Free access

Synchronization without contention

Authors:

John M. Mellor-Crummey,

Michael L. ScottAuthors Info & Claims

ACM SIGOPS Operating Systems Review, Volume 25, Issue Special Issue

Pages 269 - 278

https://doi.org/10.1145/106974.106999

Published: 01 April 1991 Publication History

PDF eReader

References

[1]

S. V. Adve and M. D. Hill. Weak ordering--a new definition. In Proc. Int'l. Syrup. on Computer Architecture, pages 2-14, May 1990.

Digital Library

Google Scholar

[2]

A. Agarwal and M. Cherian. Adaptive backoff synchronization techniques. In Proc. Int'l. Syrup. on Computer Architecture, pages 396-406, May 1989.

Digital Library

Google Scholar

[3]

T. E. Anderson. The performance implications of spinwaiting alternatives for shared memory multiprocessors. In Proc. 1989 Int'l. Conf. on Parallel Processing, pages II-i 70- II-174, Aug. 1989.

Google Scholar

[4]

BBN Laboratories. Butterfly parallel processor overview. Technical Report 6148, Version 1, BBN Laboratories, Cambridge, MA, Mar. 1986.

Google Scholar

[5]

E. D. Brooks II{. The butterfly barrier, international Journal of Parallel Programming, 15(4):295-307, 1986.

Digital Library

Google Scholar

[6]

E. D. Brooks III. The shared memory hypercube. PamUel Computing, 6:235-245, 1988.

Google Scholar

[7]

P. J. Controls, F. Heymans, and D. L. Parnas. Concurrent control with 'readers' and 'writers'. CA CM~ 14(10):667-668, Oct. 1971.

Digital Library

Google Scholar

[8]

K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. L. tIennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proc. Int'l. Syrup. on Computer Architecture, pages 15- 26, May 1990.

Digital Library

Google Scholar

[9]

J. R. Goodman, M. K. Vernon, and P. J. Woest. Efficient synchronization primitives for large-scale cache-coherent multiprocessors. In Proc. 3rd Int'l. Conf. on Architectural Support for Programming Languages and Operating Systems, pages 64-75, Apr. 1989.

Digital Library

Google Scholar

[10]

A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir. The NYU Uttracomputer- designing an MIMD shared memory parallel computer. IEEE Transactions on Computers, C-32(2):175-189, Feb. 1983.

Digital Library

Google Scholar

[11]

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

Digital Library

Google Scholar

[12]

D. Hensgen, R. Finkel, and U. Manber. Two algorithms for barrier synchronization. International Journal of Parallel Programming, 17(1):1-17, 1988.

Digital Library

Google Scholar

[13]

M. Herlihy. A methodology for implementing highly concurrent data structures, in Proc. 2nd A CM Syrup. on Principles and Practice of PamUel Programming, pages 197-206, Mar. 1990.

Digital Library

Google Scholar

[14]

D. N. Jayasimha. Distributed synchronizers. In Proc. 1988 Int'l. Conf. on Parallel Processing, pages 23-27, Aug. 1988.

Google Scholar

[15]

C. P. Kruskai, L. Rudolph, and M. Snir. Efficient synchronization on muItiprocessors with shared memory. In Proc. 5th A CM Syrup. on Principles of Distributed Computing, pages 218-228, 1986.

Digital Library

Google Scholar

[16]

J. Lee and U. Ramachandran. Synchronization with multiprocessor caches, in Proc. Int'l. Syrup. on Computer Architecture, pages 27-37, May 1990.

Digital Library

Google Scholar

[17]

B. Lubachevsky. Synchronization barrier and related tools for shared memory parallel programming. In Proc. 1989 Int'l. Conf. on Parallel Processing, pages II-175-II-179, Aug. 1989.

Google Scholar

[18]

J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. Technical R.eport 342, Computer Science Department, University of Rochester, Apr. 1990. Also COMP TP,90-114, Department of Computer Science, Rice University, May 1990; revised version to appear in A CM Transactions on Computer Systems.

Digital Library

Google Scholar

[19]

J. M. Mellor-Crummey and M. L. Scott. Scalable readerwriter synchronization for shared-memory multiprocessors. In Proc. 3rd A CM Syrup. on Principles and Practice of Parallel Programming, Apr. 1991.

Digital Library

Google Scholar

[20]

P1596 Working Group of the IEEE Computer Society Microprocessor Standards Committee. SCI (scalable coherent interface): An overview of extended cache-coherence protocols, Feb. 5, 1990. Draft 0.59 P1596/Part III-D.

Google Scholar

[21]

G. Pfister et al. The iBM research parallel processor prototype (R. P3): Introduction and architecture. In Proc. I985 Int'l. Con/. on Parallel Processing, pages 764-771, Aug. 1985.

Google Scholar

[22]

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

[23]

D. P. Reed and R. K. Kanodia. Synchronization with eventcounts and sequencers. Communications of the A CM, 22(2):115-123, Feb. 1979.

Digital Library

Google Scholar

[24]

R. D. Rettberg, W. R. Crowther, P. P. Carvey, and R. S. Tomlinson. The Monarch parallel processor hardware design. Computer, 23(4):18-30, Apr. 1990.

Digital Library

Google Scholar

[25]

L. Rudolph and Z. Segall. Dynamic decentralized cache schemes for MIMD parallel processors. In Proc. Int'l. Syrup. on Computer Architecture, pages 340-347, 1984.

Digital Library

Google Scholar

[26]

P.-C. Yew. Architecture of the Cedar parallel supercomputer. CSRD report 609, Center for Supercomputing Research and Development, University of Illinois Urbana-Champaign, A uS. 1986.

Google Scholar

[27]

P.-C. Yew, N.-F. Tzeng, and D. tI. Lawrie. Distributing hotspot addressing in large-scale multiprocessors. IEEE Transactions on Computers, C-36(4):388-395, Apr. 1987.

Digital Library

Google Scholar

Cited By

View all

Johnson T(1994)Parallel-access memory management using fast-fitsInternational Journal of Parallel Programming10.1007/BF0257787122:6(617-648)Online publication date: 1-Dec-1994
https://dl.acm.org/doi/10.1007/BF02577871
Scott MMellor-Crummey J(1994)Fast, contention-free combining tree barriers for shared-memory multiprocessorsInternational Journal of Parallel Programming10.1007/BF0257774122:4(449-481)Online publication date: 1-Aug-1994
https://dl.acm.org/doi/10.1007/BF02577741
Endo WSato STaura K(2022)ComposableThreads: Rethinking User-level Threads with Composability and Parametricity in C++Journal of Information Processing10.2197/ipsjjip.30.26930(269-282)Online publication date: 2022
https://doi.org/10.2197/ipsjjip.30.269
Show More Cited By

Index Terms

Synchronization without contention

Recommendations

Skewless network clock synchronization without discontinuity: convergence and performance

This paper examines synchronization of computer clocks connected via a data network and proposes a skewless algorithm to synchronize them. Unlike existing solutions, which either estimate and compensate the frequency difference (skew) among clocks or ...
On hot-spot contention in interconnection networks
SIGMETRICS '88: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems

A major component of a parallel machine is its interconnection network, which provides concurrent communication between the processing elements. It is common to use a multi-stage interconnection network (MIN) which is constructed using crossbar switches ...
Hot-Spot Contention in Binary Hypercube Networks

Consideration is given to the impact of hot-spot contention in distributed-memory multicomputer systems. Since the binary hypercube network offers a reasonable compromise between network cost and performance, two hypercube-based static interconnection ...

Comments

Information & Contributors

Information

Published In

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 SIGOPS Volume 25, Issue Special Issue

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

100
Total Citations
View Citations
1,334
Total Downloads

Downloads (Last 12 months)167
Downloads (Last 6 weeks)39

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Johnson T(1994)Parallel-access memory management using fast-fitsInternational Journal of Parallel Programming10.1007/BF0257787122:6(617-648)Online publication date: 1-Dec-1994
https://dl.acm.org/doi/10.1007/BF02577871
Scott MMellor-Crummey J(1994)Fast, contention-free combining tree barriers for shared-memory multiprocessorsInternational Journal of Parallel Programming10.1007/BF0257774122:4(449-481)Online publication date: 1-Aug-1994
https://dl.acm.org/doi/10.1007/BF02577741
Endo WSato STaura K(2022)ComposableThreads: Rethinking User-level Threads with Composability and Parametricity in C++Journal of Information Processing10.2197/ipsjjip.30.26930(269-282)Online publication date: 2022
https://doi.org/10.2197/ipsjjip.30.269
Groote JLaveaux Mvan Spaendonck P(2022)A Thread-Safe Term LibraryLeveraging Applications of Formal Methods, Verification and Validation. Verification Principles10.1007/978-3-031-19849-6_25(422-459)Online publication date: 17-Oct-2022
https://doi.org/10.1007/978-3-031-19849-6_25
Giannoula CVijaykumar NPapadopoulou NKarakostas VFernandez IGomez-Luna JOrosa LKoziris NGoumas GMutlu O(2021)SynCron: Efficient Synchronization Support for Near-Data-Processing Architectures2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA51647.2021.00031(263-276)Online publication date: Feb-2021
https://doi.org/10.1109/HPCA51647.2021.00031
Gu YMellor-Crummey J(2018)Dynamic data race detection for OpenMP programsProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.5555/3291656.3291738(1-12)Online publication date: 11-Nov-2018
https://dl.acm.org/doi/10.5555/3291656.3291738
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
Gu YMellor-Crummey J(2018)Dynamic data race detection for OpenMP programsProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC.2018.00064(1-12)Online publication date: 11-Nov-2018
https://dl.acm.org/doi/10.1109/SC.2018.00064
Anenkov APaznikov AKurnosov M(2018)Algorithms for Access Localization to Objects of Scalable Concurrent Pools Based on Diffracting Trees in Multicore Computer Systems2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE)10.1109/APEIE.2018.8545197(374-380)Online publication date: Oct-2018
https://doi.org/10.1109/APEIE.2018.8545197
Voron GThomas GQuéma VSens P(2017)An interface to implement NUMA policies in the Xen hypervisorProceedings of the Twelfth European Conference on Computer Systems10.1145/3064176.3064196(453-467)Online publication date: 23-Apr-2017
https://dl.acm.org/doi/10.1145/3064176.3064196
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

Skewless network clock synchronization without discontinuity: convergence and performance

On hot-spot contention in interconnection networks

Hot-Spot Contention in Binary Hypercube Networks

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