There are 5 repositories under partitioning-algorithms topic.
METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering
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.
O'Reilly Book: [Data Algorithms with Spark] by Mahmoud Parsian
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.
Big Data Modeling, MapReduce, Spark, PySpark @ Santa Clara University
Generic graph (analysis) library in Typescript
implementation of partitioning mechanism on Apache Kafka and asynchronous communication between Vert.x microservices
Codes pertaining to OS Lab for Course CO254 - Operating Systems[CSE NITK SEM-4]
Jet: Graph Partitioner for GPU
A Python library for anti-clustering algorithms
Coursework of NTHU CS613500 VLSI Physical Design Automation
Judicious Graph Partitioning
Single-master group membership framework with failure detection useful for stateless partitioning
Partitions an interval as evenly as possible.
Coursework of NTHU CS516000 FPGA Architecture & CAD
Generic worst-case-linear-time sorting and partitioning algorithms based on discriminators
Hardware/Software Partitioning for FFT Algorithm
Complex ray tracing algorithm optimized by using parallelization over different partitioning schemes and explore the performance gains through grain size and processing units (parameters) over sequential algorithm to render a high resolution image.
An implementation of a branch and bound method based bi-partitioning algorithm.
Collection of clustering algorithms for polygonal curves.
Quick implementation of the Kernighan-Lin graph partition algorithm in Python
A program to distribute sheet music parts to players, minimizing movement of players between pieces.
This project aims at creating a decentralized partitioning protocol that guarantees consistent partitioning and termination even in dynamic settings where nodes join and leave the system, create or destroy partitions.
Example code for Reordering Arguments blog post (www.hardtoc.com)
A partitioning algorithm for OWL
Simple implementation of the Dutch national flag problem in Golang
algorithms & functions for sorting and general DS problems
Assignments for the Computer Systems Performance course at the IT University of Copenhagen
Automatic, single-pass algorithms to partitioning and optimizing C/C++ applications for heterogeneous systems