Big Data Modeling, MapReduce, Spark, PySpark @ Santa Clara University

METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering

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

KaHIP -- Karlsruhe HIGH Quality Partitioning.

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.

CMake enhanced Karypis METIS library

implementation of partitioning mechanism on Apache Kafka and asynchronous communication between Vert.x microservices

Generic graph (analysis) library in Typescript

METIS partitioner for mesh and graph

Jet: Graph Partitioner for GPU

Codes pertaining to OS Lab for Course CO254 - Operating Systems[CSE NITK SEM-4]

Single-master group membership framework with failure detection useful for stateless partitioning

A partitioning algorithm for OWL

Coursework of NTHU CS516000 FPGA Architecture & CAD

An implementation of a branch and bound method based bi-partitioning algorithm.

This project demonstrates how to use the "Partitioning Around Medoids" (PAM) technique to create clusters

A C++ implementation of the Quad-Tree spatial index.