kahypar / mt-kahypar
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.
☆140Updated last week
Alternatives and similar repositories for mt-kahypar:
Users that are interested in mt-kahypar are comparing it to the libraries listed below
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆457Updated last month
- Implementation of the HYPE hypergraph partitioner.☆19Updated 5 years ago
- Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes☆66Updated 5 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated last week
- The implementation is based on the Fiduccia-Mattheyses algorithm.☆29Updated 8 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated last month
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 weeks ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆429Updated this week
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated last week
- GPU-based logic synthesis tool☆81Updated 9 months ago
- ☆20Updated 6 months ago
- Parallel sparse direct solver for circuit simulation☆43Updated 2 years ago
- ☆10Updated 9 months ago
- Implementation of hMETIS☆11Updated 2 years ago
- C++ logic network library☆228Updated 6 months ago
- Library for VLSI CAD Design Useful parsers and solvers' api are implemented.☆157Updated 3 months ago
- The first version of TritonPart☆26Updated last year
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Pursuing the best performance of linear solver in circuit simulation☆38Updated 2 months ago
- AMF-Placer 2.0: An open-source timing-driven analytical mixed-size FPGA placer of heterogeneous resources (LUT/FF/LUTRAM/MUX/CARRY/DSP/BR…☆101Updated last year
- 🕹 OpenPARF: An Open-Source Placement and Routing Framework for Large-Scale Heterogeneous FPGAs with Deep Learning Toolkit☆138Updated 2 months ago
- ☆29Updated 4 years ago
- Xplace 2.0: An Extremely Fast, Extensible and Deterministic Placement Framework with Detailed-Routability Optimization☆119Updated 4 months ago
- [ICCAD 22]DeePEB: A neural network based PEB solver☆10Updated 2 years ago
- Heterogeneous Programming☆17Updated 2 years ago
- ☆17Updated 7 months ago
- A Design Rule Checker with GPU Acceleration☆48Updated last year
- The Combinatorial BLAS (CombBLAS) is an extensible distributed-memory parallel graph library offering a small but powerful set of linear …☆72Updated last month
- Galois: C++ library for multi-core and multi-node parallelization☆325Updated 11 months ago
- Dynamic data structure for sparse graphs.☆30Updated last year