MST: Parallel Minimum Spanning Forest
-
Updated
Dec 28, 2020 - C
MST: Parallel Minimum Spanning Forest
Parallel List Ranking for multicore processors
Parallel Biconnected Components
SWARM: Software and Algorithms for Running on Multicore
SIMPLE is a framework for implementation of parallel algorithms using our methodology for developing high performance programs running on clusters of SMP nodes. Our methodology is based on a small kernel (SIMPLE) of collective communication primitives that make efficient use of the hybrid shared and message passing environment. We illustrate the…
Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs
Rake: Parallel Expression Evaluation using Tree Contraction
PSort: Parallel Sorting using Sampling with Randomized and Deterministic Approaches
PMedian: Parallel Selection and Median Finding
A Fork of CMU's pbbslib (c++17-based parallel primitives)
Add a description, image, and links to the parallel-primitives topic page so that developers can more easily learn about it.
To associate your repository with the parallel-primitives topic, visit your repo's landing page and select "manage topics."