GPU-Accelerated Graph Partitioning Algorithms in VLSI Design
保存先:
| 出版年: | ProQuest Dissertations and Theses (2025) |
|---|---|
| 第一著者: | |
| 出版事項: |
ProQuest Dissertations & Theses
|
| 主題: | |
| オンライン･アクセス: | Citation/Abstract Full Text - PDF |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3285433464 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 9798270241681 | ||
| 035 | |a 3285433464 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Lee, Wan Luan | |
| 245 | 1 | |a GPU-Accelerated Graph Partitioning Algorithms in VLSI Design | |
| 260 | |b ProQuest Dissertations & Theses |c 2025 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a Graph and hypergraph play critical roles in computer‑aided design (CAD) because it allows us to break down a large circuit into several manageable pieces that facilitate efficient CAD algorithm designs. However, as circuit sizes continue to grow, partitioning becomes increasingly time‑consuming. To address this runtime bottleneck, many researchers have leveraged CPU-parallel techniques to accelerate partitioning. However, the speedups are typically limited to 8–16 CPU threads. To overcome this challenge, this thesis leverages the massive parallelism of GPUs and introduces two GPU-accelerated partitioning algorithms: iG-kway for graphs and iHyperG for hypergraphs. G-kway features a union find-based coarsening algorithm that merges many vertices simultaneously, and a novel independent-set-based refinement algorithm that refines thousands of vertices in parallel. HyperG introduces a balanced group coarsening method and a sequence-based refinement algorithm. Experimental results show that G-kway achieves an average speedup of 8.6x over the CPU-parallel graph partitioner mt-metis, while HyperG delivers an average speedup of 4.1x over the CPU-parallel hypergraph partitioner Mt-KaHyPar, both maintaining comparable cut quality. While G-kway and HyperG achieve new performance milestones in graph and hypergraph partitioning, they are limited to full partitioning. This lack of support for incrementality presents a critical limitation for many CAD applications, where circuits undergo iterative modifications as part of optimization loops. To address this limitation, this thesis also introduces two GPU-parallel incremental partitioning algorithms: iG-kway for graphs and iHyperG for hypergraphs. iG-kway features an incrementality-aware bucket-list data structure and a refinement kernel that refines only affected vertices. iHyperG introduces a scalable delta-based hypergraph data structure for efficient incremental modifications on the GPU, along with an effective incremental partitioning algorithm that rebalances the partition in a single pass and refines only cut-critical vertices. Experimental results show that iG-kway achieves an average speedup of 84x over the GPU-based full graph partitioner G-kway, while iHyperG delivers 190x speedup for hypergraph modification and 83x for partitioning over the state-of-the-art GPU-based full hypergraph partitioner, both maintaining comparable cut quality. | |
| 653 | |a Computer engineering | ||
| 653 | |a Computer science | ||
| 653 | |a Systems science | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (2025) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3285433464/abstract/embedded/H09TXR3UUZB2ISDL?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3285433464/fulltextPDF/embedded/H09TXR3UUZB2ISDL?source=fedsrch |