A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
Alternatives To Parlaylib
Project NameStarsDownloadsRepos Using ThisPackages Using ThisMost Recent CommitTotal ReleasesLatest ReleaseOpen IssuesLicenseLanguage
2 years ago22mpl-2.0C++
An open-source library of algorithms to analyse time series in GPU and CPU.
a month ago9mitC++
A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
Hpcsharp170112 months ago69September 26, 20222apache-2.0C#
High performance algorithms in C#: SIMD/SSE, multi-core and faster
5 years ago8otherC++
Embedded Multicore Building Blocks (EMB²): Library for parallel programming of embedded systems. Star us on GitHub? +1
5 years ago2R
R/Rcpp implementation of the 'Follow-the-Regularized-Leader' algorithm
2 years agoapache-2.0Go
A CLI tool to find/remove duplicate files supporting multi-core and different algorithms (MD5, SHA256, and XXHash).
3 years agomitC++
Collection of algorithms in C++ for main-memory skyline computation
9 years ago6mitC
a year ago1gpl-3.0C
A Bit-Parallel Global Sequence Alignment Toolkit for Multi-core and Many-core Architectures.
4 years agoC++
Implementation of Hierarchy Oblivious Algorithms
Alternatives To Parlaylib
Select To Compare

Alternative Project Comparisons

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

Build status codecov License: MIT

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.

Parlay is designed to be reasonably portable by being built upon mostly standards-compliant modern C++. It builds on GCC and Clang on Linux, GCC and Apple Clang on OSX, and Microsoft Visual C++ (MSVC) and MinGW on Windows. It is also tested on GCC and Clang via Windows Subsystem for Linux (WSL) and Cygwin. Support beyond x86-64 has not yet been explored. We would warmly welcome contributions that seek to achieve this.


You can find Parlay's full reference documentation here


Parlay comes with over 50 example applications that you can learn from. You can find them in the examples directory.

Developer documentation

If you are interested in contributing to Parlay, the following pages describe useful information about our testing and benchmarking setups. If you just want to use Parlay in your own projects, these links are not relevant to you.

Popular Multicore Projects
Popular Algorithms Projects
Popular Software Performance Categories
Related Searches

Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
C Plus Plus
Parallel Computing