REVIEW 3 cited by
KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions provided within the framework. Since version 3.00 we support multilevel partitioning, memetic algorithms, distributed and shared-memory parallel algorithms, node separator and ordering algorithms, edge partitioning algorithms as well as ILP solvers.
Forward citations
Cited by 3 Pith papers
-
SIGMA: A Versatile Streaming Graph Partitioner for Vertex- and Edge-Balanced Distributed GNN Training
SIGMA is a unified streaming graph partitioner supporting configurable vertex- and edge-balanced partitioning for distributed GNN training across different system architectures.
-
Programmable Probabilistic Computer with 1,000,000 p-bits
Networked FPGAs create a million-p-bit probabilistic computer that matches monolithic GPU performance above a boundary-exchange frequency threshold eta, with a mean-field model showing the resulting accuracy-throughpu...
-
How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits
A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.
Discussion (0). Sign in to comment.