Header-Only C++ Library for Graph Representation and Algorithms

KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.

KaHIP -- Karlsruhe HIGH Quality Partitioning.

Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.

Implementations of Binary Space Parititoning and Sort Tile Recursive Partitioning algorithm.

METIS, Balanced Label Propagation, Bayesian Sharding, and its optimization techniques

Shared-Memory Parallel Multilevel Partitioning.

A distributed, sharded key value store, backed by paxos, written in C++

Implementation of the matrix partitioning algorithm described in my thesis.

In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties.

Tailor is a spatially load balancing flow solver which can operate on three-dimensional moving overset meshes.

A Parallel Discrete Event Simulation Engine with Examples

Implementation of hypergraph partitioning using MinMax streaming

Spatial cache data structures with python binding implementation.

A Parallel Graph Partitioning Approach designed to work on density-based clustering algorithms.

✂️ Simple C++ program to perform line-based partitioning of files.

PSML: parallel system modeling and simulation language for electronic system level

Verlet particle simulator that uses spatial grid partitioning for more optimized collision detection.

University of Pittsburgh ECE 0302

Multiway Parallel Quicksort (MPQsort) is a fast implementation of parallel in-place Quicksort using OpenMP.