research-article

Free access

The balancing act of choosing nonblocking features

Author:

Maged M. MichaelAuthors Info & Claims

Communications of the ACM, Volume 56, Issue 9

Pages 46 - 53

https://doi.org/10.1145/2500468.2500476

Published: 01 September 2013 Publication History

All formats PDF

Abstract

Design requirements of nonblocking systems.

References

[1]

Attiya, H. and Hendler, D. Time and space lower bounds for implementations using k-CAS. In Proceedings of the 19^th International Conference on Distributed Computing (2005), 169--183.

Digital Library

Google Scholar

[2]

Brown, P.J., Smith, R.M. 1973. U.S. Patent 3,886,525. Shared data controlled by a plurality of users (filed June 1973).

Google Scholar

[3]

Cain, H.W., Frey, B. Williams, D., Michael, M.M., May, C. and Le, H. Robust architectural support for transactional memory in the Power architecture. ACM/IEEE 40^th International Symposium on Computer Architecture (2013).

Digital Library

Google Scholar

[4]

Dragojevic, A., Herlihy, M., Lev, Y. and Moir, M. On the power of hardware transactional memory to simplify memory management. In Proceedings of the 30^th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (2011), 99--108.

Digital Library

Google Scholar

[5]

Fatourou, P., Kallimanis, N.D. A highly efficient wait-free universal construction. ACM Symposium on Parallelism in Algorithms and Architectures (2011) 325--334.

Digital Library

Google Scholar

[6]

Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N. and Shavit, N. A lazy concurrent list-based set algorithm. In Proceedings of the Ninth International Conference on Principles of Distributed Systems (2005): 3--16.

Digital Library

Google Scholar

[7]

Herlihy, M. Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13, 1d (1991), 124--149.

Digital Library

Google Scholar

[8]

Herlihy, M., Luchangco, V., Martin, P.A. and Moir, M. Nonblocking memory management support for dynamic-sized data structures. ACM Transactions on Computer Systems 23, 2 (2005), 146--196.

Digital Library

Google Scholar

[9]

Herlihy, M., Luchangco, V. and Moir, M. Obstruction-free synchronization: double-ended queues as an example. In Proceedings of the 23^rd International Conference on Distributed Computing Systems (2003), 522--529.

Digital Library

Google Scholar

[10]

IBM System/370 Principles of Operation. 1975. GA22-7000-4.

Google Scholar

[11]

Intel Architecture Instruction Set Extensions Programming Reference. 2012.

Google Scholar

[12]

Jacobi, C., Slegel, T.J., Greiner, D.F. Transactional Memory Architecture and Implementation for IBM System Z. In Proceedings of the 45^th Annual IEEE/ACM International Symposium on Microarchitecture (2012), 25--36.

Digital Library

Google Scholar

[13]

McKenney, P. Structured deferral: Synchronization via procrastination. ACM Queue (2013); http://queue.acm.org/detail.cfm?id=2488549

Digital Library

Google Scholar

[14]

McKenney, P.E., Slingwine, J.D. Read-copy update: using execution history to solve concurrency problems. In Proceedings of the 10^th IASTED International Conference on Parallel and Distributed Computing and Systems (1998).

Google Scholar

[15]

Michael, M.M. and Scott, M.L. Simple, fast, and practical nonblocking and blocking concurrent queue algorithms. In Proceedings of the 15^th Annual ACM Symposium on Principles of Distributed Computing (1996); 267--275.

Digital Library

Google Scholar

[16]

Michael, M.M. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Transactions on Parallel Distributed Systems 15, 6 (2004), 491--504.

Digital Library

Google Scholar

[17]

Michael, M.M. Scalable lock-free dynamic memory allocation. In Proceedings of the 2004 ACM SIGPLAN Conference on Programming Language Design and Implementation (2004).

Digital Library

Google Scholar

[18]

Michael, M.M. Practical lock-free and wait-free LL/SC/VL implementations using 64-bit CAS. In Proceedings of the 18^th International Conference on Distributed Computing (2004); 144--158.

Google Scholar

[19]

Timnat, S., Braginsky, A., Kogan, A. and Petrank, E. Wait-free linked-lists. In Proceedings of the 16^th International Conference on Principles of Distributed Systems (2012), 330--344.

Digital Library

Google Scholar

[20]

Valois, J.D. Lock-free linked lists using compare-and-swap. In Proceedings of the 14^th Annual ACM Symposium on Principles of Distributed Computing (1995), 214--222.

Digital Library

Google Scholar

[21]

Wang, A., Gaudet, M., Wu, P., Amaral, J.N., Ohmacht, M., Barton, C., Silvera, R. and Michael, M.M. Evaluation of Blue Gene/Q hardware support for transactional memories. In Proceedings of the 21^st International Conference on Parallel Architectures and Compilation Techniques (2012), 127--136.

Digital Library

Google Scholar

Cited By

View all

Gulisano VNikolakopoulos YPapatriantafilou MTsigas P(2021)ScaleJoin: A Deterministic, Disjoint-Parallel and Skew-Resilient Stream JoinIEEE Transactions on Big Data10.1109/TBDATA.2016.26242747:2(299-312)Online publication date: 1-Jun-2021
https://doi.org/10.1109/TBDATA.2016.2624274
Machanick PPetratos Svan Niekerk JHaskins B(2018)A preliminary study of minimal-contention locksProceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists10.1145/3278681.3278713(269-278)Online publication date: 26-Sep-2018
https://dl.acm.org/doi/10.1145/3278681.3278713
Diegues NRomano PGarbatov S(2017)SeerACM Transactions on Computer Systems10.1145/313203635:3(1-41)Online publication date: 14-Nov-2017
https://dl.acm.org/doi/10.1145/3132036
Show More Cited By

Index Terms

The balancing act of choosing nonblocking features

Recommendations

The Balancing Act of Choosing Nonblocking Features: Design requirements of nonblocking systems
Development

What is nonblocking progress? Consider the simple example of incrementing a counter C shared among multiple threads. One way to do so is by protecting the steps of incrementing C by a mutual exclusion lock L (i.e., acquire(L); old := C ; C := old+1; ...
Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution

The article gives an overview of major theoretical issues associated with a switching network structure proposed by C. Clos (1953). The concepts of strict-sense and wide-sense nonblocking as well as repackable and rearrangeable networks are described, ...
Scalable and Practical Nonblocking Switching Networks (Extended Abstract)
PDCAT '05: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies

Switching networks are widely used as core components in network switches and routers, and communication subsyetems in parallel computing systems. Most switching networks are multistage interconnection networks built with small-size switching elements. ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 56, Issue 9

September 2013

97 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/2500468

Issue’s Table of Contents

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 September 2013

Published in CACM Volume 56, Issue 9

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
5,254
Total Downloads

Downloads (Last 12 months)330
Downloads (Last 6 weeks)82

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gulisano VNikolakopoulos YPapatriantafilou MTsigas P(2021)ScaleJoin: A Deterministic, Disjoint-Parallel and Skew-Resilient Stream JoinIEEE Transactions on Big Data10.1109/TBDATA.2016.26242747:2(299-312)Online publication date: 1-Jun-2021
https://doi.org/10.1109/TBDATA.2016.2624274
Machanick PPetratos Svan Niekerk JHaskins B(2018)A preliminary study of minimal-contention locksProceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists10.1145/3278681.3278713(269-278)Online publication date: 26-Sep-2018
https://dl.acm.org/doi/10.1145/3278681.3278713
Diegues NRomano PGarbatov S(2017)SeerACM Transactions on Computer Systems10.1145/313203635:3(1-41)Online publication date: 14-Nov-2017
https://dl.acm.org/doi/10.1145/3132036
Gulisano VNikolakopoulos YCederman DPapatriantafilou MTsigas P(2017)Efficient Data Streaming Multiway Aggregation through Concurrent Algorithmic Designs and New Abstract Data TypesACM Transactions on Parallel Computing10.1145/31312724:2(1-28)Online publication date: 10-Oct-2017
https://dl.acm.org/doi/10.1145/3131272
Jeong SYang SBurgstaller B(2017)Lock Elision for Protected Objects Using Intel Transactional Synchronization ExtensionsReliable Software Technologies – Ada-Europe 201710.1007/978-3-319-60588-3_8(121-136)Online publication date: 30-May-2017
https://doi.org/10.1007/978-3-319-60588-3_8
Dick IFekete AGramoli V(2016)A skip list for multicoreConcurrency and Computation: Practice and Experience10.1002/cpe.387629:4Online publication date: 27-May-2016
https://doi.org/10.1002/cpe.3876
Gramoli V(2015)More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithmsACM SIGPLAN Notices10.1145/2858788.268850150:8(1-10)Online publication date: 24-Jan-2015
https://dl.acm.org/doi/10.1145/2858788.2688501
Gramoli VCohen AGrove D(2015)More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithmsProceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/2688500.2688501(1-10)Online publication date: 24-Jan-2015
https://dl.acm.org/doi/10.1145/2688500.2688501
Nikolakopoulos YGidenstam APapatriantafilou MTsigas P(2015)A Consistency Framework for Iteration Operations in Concurrent Data StructuresProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.84(239-248)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.84
Nikolakopoulos YGidenstam APapatriantafilou MTsigas P(2015)Of Concurrent Data Structures and IterationsAlgorithms, Probability, Networks, and Games10.1007/978-3-319-24024-4_20(358-369)Online publication date: 22-Nov-2015
https://doi.org/10.1007/978-3-319-24024-4_20
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations