extended-abstract

Public Access

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines

Authors:

Guy E. Blelloch,

Daniel Anderson,

Laxman DhulipalaAuthors Info & Claims

SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

Pages 507 - 509

https://doi.org/10.1145/3350755.3400254

Published: 09 July 2020 Publication History

PDF eReader

Abstract

ParlayLib is a C++ library for developing efficient parallel algorithms and software on shared-memory multicore machines. It provides additional tools and primitives that go beyond what is available in the C++ standard library, and simplifies the task of programming provably efficient and scalable parallel algorithms. It consists of a sequence data type (analogous to std::vector), many parallel routines and algorithms, a work-stealing scheduler to support nested parallelism, and a scalable memory allocator. It has been developed over a period of seven years and used in a variety of software including the PBBS benchmark suite, the Ligra, Julienne, and Aspen graph processing frameworks, the Graph Based Benchmark Suite, and the PAM library for parallel balanced binary search trees, and an implementation of the TPC-H benchmark suite.

References

[1]

Nimar S Arora, Robert D Blumofe, and C Greg Plaxton. 2001. Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems (TOCS), Vol. 34, 2 (2001), 115--144.

Crossref

Google Scholar

[2]

Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. 1995. Cilk: An Efficient Multithreaded Runtime System. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP).

Digital Library

Google Scholar

[3]

Robert D Blumofe and Charles E Leiserson. 1999. Scheduling multithreaded computations by work stealing. J. ACM, Vol. 46, 5 (1999), 720--748.

Digital Library

Google Scholar

[4]

Laxman Dhulipala, Guy E. Blelloch, and Julian Shun. 2017. Julienne: A Framework for Parallel Graph Algorithms Using Work-efficient Bucketing. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).

Digital Library

Google Scholar

[5]

Laxman Dhulipala, Guy E. Blelloch, and Julian Shun. 2018. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).

Google Scholar

[6]

Laxman Dhulipala, Guy E Blelloch, and Julian Shun. 2019. Low-latency graph streaming using compressed purely-functional trees. In ACM Conference on Programming Language Design and Implementation (PLDI).

Digital Library

Google Scholar

[7]

Yan Gu, Julian Shun, Yihan Sun, and Guy E. Blelloch. 2015. A Top-Down Parallel Semisort. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).

Google Scholar

[8]

Switzerland International Organization for Standardization, Geneva. 2018. ISO/IEC TS 19570:2018: Programming Languages -- Technical Specification for C+ Extensions for Parallelism. https://www.iso.org/standard/70588.html.

Google Scholar

[9]

Julian Shun and Guy E. Blelloch. 2013. Ligra: A Lightweight Graph Processing Framework for Shared Memory. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP) .

Google Scholar

[10]

Julian Shun and Guy E Blelloch. 2014. Phase-concurrent hash tables for determinism. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).

Digital Library

Google Scholar

[11]

Yihan Sun, Guy E Blelloch, Wan Shen Lim, and Andrew Pavlo. 2019. On supporting efficient snapshot isolation for hybrid workloads with multi-versioned indexes. PVLDB, Vol. 13, 2 (2019), 211--225.

Digital Library

Google Scholar

[12]

Yihan Sun, Daniel Ferizovic, and Guy E Blelloch. 2018. PAM: Parallel Augmented Maps. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP).

Digital Library

Google Scholar

Cited By

View all

Men ZShen ZGu YSun Y(2025)Parallel kd-tree with Batch UpdatesProceedings of the ACM on Management of Data10.1145/37097123:1(1-26)Online publication date: 11-Feb-2025
https://dl.acm.org/doi/10.1145/3709712
Engels JLandrum BYu SDhulipala LShun JSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Approximate nearest neighbor search with window filtersProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692567(12469-12490)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692567
Khan JRubel TMolloy EDhulipala LPatro R(2024)Fast, parallel, and cache-friendly suffix array constructionAlgorithms for Molecular Biology10.1186/s13015-024-00263-519:1Online publication date: 28-Apr-2024
https://doi.org/10.1186/s13015-024-00263-5
Show More Cited By

Index Terms

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines

Recommendations

The NAS Parallel Benchmarks for evaluating C++ parallel programming frameworks on shared-memory architectures
Abstract
The NAS Parallel Benchmarks (NPB), originally implemented mostly in Fortran, is a consolidated suite containing several benchmarks extracted from Computational Fluid Dynamics (CFD) models. The benchmark suite has important ...
Highlights
- The NAS Parallel Benchmarks for evaluating C++ parallel programming.
- Structured ...
Shared-Memory Parallel Programming in C++

A set of portable parallel-programming constructs for C, implemented in M4 macros called Parmacs, developed by researchers at Argonne National Laboratory, is considered. The Parmacs macros make it possible to write parallel C programs for shared-memory, ...
Abstract state machines capture parallel algorithms: Correction and extension

We consider parallel algorithms working in sequential global time, for example, circuits or parallel random access machines (PRAMs). Parallel abstract state machines (parallel ASMs) are such parallel algorithms, and the parallel ASM thesis asserts that ...

Comments

Information & Contributors

Information

Published In

SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

July 2020

601 pages

ISBN:9781450369350

DOI:10.1145/3350755

General Chair:
Christian Scheideler
Institut fuer Informatik Universitaet Paderborn Fuerstenallee 11
,
Program Chair:
Michael Spear

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 July 2020

Check for updates

Author Tags

Qualifiers

Extended-abstract

Funding Sources

National Science Foundation

Conference

SPAA '20

Sponsor:

SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures

July 15 - 17, 2020

Virtual Event, 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

34
Total Citations
View Citations
734
Total Downloads

Downloads (Last 12 months)229
Downloads (Last 6 weeks)25

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Men ZShen ZGu YSun Y(2025)Parallel kd-tree with Batch UpdatesProceedings of the ACM on Management of Data10.1145/37097123:1(1-26)Online publication date: 11-Feb-2025
https://dl.acm.org/doi/10.1145/3709712
Engels JLandrum BYu SDhulipala LShun JSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)Approximate nearest neighbor search with window filtersProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692567(12469-12490)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692567
Khan JRubel TMolloy EDhulipala LPatro R(2024)Fast, parallel, and cache-friendly suffix array constructionAlgorithms for Molecular Biology10.1186/s13015-024-00263-519:1Online publication date: 28-Apr-2024
https://doi.org/10.1186/s13015-024-00263-5
Ding XDong XGu YLiu YSun YDhulipala LSun Y(2024)Efficient Parallel Output-Sensitive Edit Distance (Abstract)Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing10.1145/3670684.3673407(17-18)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3670684.3673407
Dong XDhulipala LGu YSun YDhulipala LSun Y(2024)Parallel Integer Sort: Theory and Practice (Abstract)Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing10.1145/3670684.3673403(13-14)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3670684.3673403
de Wolff Ivan Balen DKeller GMcDonell T(2024)Zero-Overhead Parallel Scans for Multi-Core CPUsProceedings of the 15th International Workshop on Programming Models and Applications for Multicores and Manycores10.1145/3649169.3649248(52-61)Online publication date: 3-Mar-2024
https://dl.acm.org/doi/10.1145/3649169.3649248
Blelloch GWei YLee IChabbi MSteuwer M(2024)VERLIB: Concurrent Versioned PointersProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638501(200-214)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638501
Wheatman BBurns RBuluc AXu HLee IChabbi MSteuwer M(2024)CPMA: An Efficient Batch-Parallel Compressed Set Without PointersProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638492(348-363)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638492
Dong XDhulipala LGu YSun YLee IChabbi MSteuwer M(2024)Parallel Integer Sort: Theory and PracticeProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638483(301-315)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638483
Manohar MShen ZBlelloch GDhulipala LGu YSimhadri HSun YLee IChabbi MSteuwer M(2024)ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search AlgorithmsProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638475(270-285)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638475
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

The NAS Parallel Benchmarks for evaluating C++ parallel programming frameworks on shared-memory architectures

Shared-Memory Parallel Programming in C++

Abstract state machines capture parallel algorithms: Correction and extension

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

The NAS Parallel Benchmarks for evaluating C++ parallel programming frameworks on shared-memory architectures

Shared-Memory Parallel Programming in C++

Abstract state machines capture parallel algorithms: Correction and extension

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations