abstract

Brief announcement: multilane - a concurrent blocking multiset

Authors:

David Dice,

Oleksandr OtenkoAuthors Info & Claims

SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

Pages 313 - 314

https://doi.org/10.1145/1989493.1989545

Published: 04 June 2011 Publication History

Get Access

Abstract

We introduce an extremely simple transformation that allows composition of a more scalable concurrent blocking multiset, or bag, from multiple "lanes" of a potentially less scalable underlying multiset. Our design disperses accesses over the various lanes, reducing contention and memory coherence hot spots. Implemented in Java, for instance, we construct a multiset from multiple lanes of java.util.concurrent.SynchronousQueue that yields more than 8 times the aggregate throughput of a single instance of SynchronousQueue when run on a 64-way Sun Niagara-2 system with 16 producer threads and 16 consumer threads. We experimented with various queues from java.util.conconcurrent and found that in general a MultiLane form will outperform its underlying counterpart.

References

[1]

Y. Afek, G. Korland, M. Natanzon, and N. Shavit. Scalable producer-consumer pools based on elimination-diffraction trees. Euro-Par'10. http://dx.doi.org/10.1007/978-3-642-15291-7_16.

Digital Library

Google Scholar

[2]

Y. Afek, G. Korland, and E. Yanovsky. Quasi-linearizability: Relaxed consistency for improved concurrency. PODC 2010.

Crossref

Google Scholar

[3]

D. Dice. Dave Dice's blog, 2011 (accessed Feb 15, 2011). http://blogs.sun.com/dave/entry/atomic_fetch_and_add_vs.

Google Scholar

[4]

A. Gottlieb, B. D. Lubachevsky, and L. Rudolph. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Program. Lang. Syst., 5:164--189, April 1983.

Digital Library

Google Scholar

[5]

D. Hendler, I. Incze, N. Shavit, and M. Tzafrir. Flat combining and the synchronization-parallelism tradeoff. SPAA '10. http://doi.acm.org/10.1145/1810479.1810540.

Digital Library

Google Scholar

[6]

D. Hendler, I. Incze, N. Shavit, and M. Tzafrir. Scalable flat-combining based synchronous queues. In Distributed Computing. 2010. http://dx.doi.org/10.1007/978-3-642-15763-9_8.

Digital Library

Google Scholar

[7]

J. M. Mellor-Crummey. Concurrent queues: Practical fetch-and-φ algorithms. 1987. University of Rochester Computer Science Technical Report # 229.

Google Scholar

[8]

M. M. Michael and M. L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. PODC '96. http://doi.acm.org/10.1145/248052.248106.

Digital Library

Google Scholar

[9]

W. N. Scherer, III, D. Lea, and M. L. Scott. Scalable synchronous queues. Commun. ACM, 52:100--111, May 2009.

Digital Library

Google Scholar

[10]

J. Wilson. Operating System Data structures for Shared-Memory MIMD Machines with Fetch-and-Add, 1988. PhD Dissertation, New York University.

Digital Library

Google Scholar

Cited By

View all

Kappes GAnastasiadis S(2024)Diciclo: Flexible User-level Services for Efficient Multitenant IsolationACM Transactions on Computer Systems10.1145/363940442:1-2(1-47)Online publication date: 13-Feb-2024
https://dl.acm.org/doi/10.1145/3639404
Kappes GAnastasiadis SLee JPetrank E(2021)A lock-free relaxed concurrent queue for fast work distributionProceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3437801.3441583(454-456)Online publication date: 17-Feb-2021
https://dl.acm.org/doi/10.1145/3437801.3441583
Haas ALippautz MHenzinger TPayer HSokolova AKirsch CSezgin AFranke HHeinecke APalem KUpfal E(2013)Distributed queues in shared memoryProceedings of the ACM International Conference on Computing Frontiers10.1145/2482767.2482789(1-9)Online publication date: 14-May-2013
https://dl.acm.org/doi/10.1145/2482767.2482789
Show More Cited By

Index Terms

Brief announcement: multilane - a concurrent blocking multiset
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Concurrency control

Recommendations

Brief announcement: on enhancing concurrency in distributed transactional memory
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase concurrency, we ...
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing

Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and write sets, an approach that often leads to false conflicts. A second is ...
Brief Announcement: Extending Transactional Memory with Atomic Deferral
SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures

Atomic deferral is a language-level mechanism for transactional memory (TM) that enables programmers to move output and long-running operations out of a transaction's body without sacrificing serializability: the deferred operation appears to execute as ...

Comments

Information & Contributors

Information

Published In

SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

June 2011

404 pages

ISBN:9781450307437

DOI:10.1145/1989493

Co-chairs:
Friedhelm Meyer auf der Heide
University of Paderborn, Germany
,
Rajmohan Rajaraman
Northeastern University, USA

In-Cooperation

EATCS: European Association for Theoretical Computer Science

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Abstract

Conference

SPAA '11

Sponsor:

SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures

June 4 - 6, 2011

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
157
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kappes GAnastasiadis S(2024)Diciclo: Flexible User-level Services for Efficient Multitenant IsolationACM Transactions on Computer Systems10.1145/363940442:1-2(1-47)Online publication date: 13-Feb-2024
https://dl.acm.org/doi/10.1145/3639404
Kappes GAnastasiadis SLee JPetrank E(2021)A lock-free relaxed concurrent queue for fast work distributionProceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3437801.3441583(454-456)Online publication date: 17-Feb-2021
https://dl.acm.org/doi/10.1145/3437801.3441583
Haas ALippautz MHenzinger TPayer HSokolova AKirsch CSezgin AFranke HHeinecke APalem KUpfal E(2013)Distributed queues in shared memoryProceedings of the ACM International Conference on Computing Frontiers10.1145/2482767.2482789(1-9)Online publication date: 14-May-2013
https://dl.acm.org/doi/10.1145/2482767.2482789
Calciu IDice DHarris THerlihy MKogan AMarathe VMoir M(2013)Message Passing or Shared MemoryProceedings of the 17th International Conference on Principles of Distributed Systems - Volume 830410.1007/978-3-319-03850-6_7(83-97)Online publication date: 16-Dec-2013
https://dl.acm.org/doi/10.1007/978-3-319-03850-6_7

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Brief announcement: on enhancing concurrency in distributed transactional memory

Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures

Brief Announcement: Extending Transactional Memory with Atomic Deferral

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations