GANGR: GAN-Assisted Scalable and Efficient Global Routing Parallelization

• URL: http://arxiv.org/abs/2511.17665v1
• Date: Fri, 21 Nov 2025 00:32:33 GMT
• Title: GANGR: GAN-Assisted Scalable and Efficient Global Routing Parallelization
• Abstract summary: Global routing is a critical stage in electronic design automation (EDA)<n>This paper introduces Wasserstein generative networks (WGANs) to enable more effective parallelization.<n>The proposed algorithm is tested on the latest ISPD'24 contest benchmarks, demonstrating up to 40% reduction with only 0.002% degradation in routing quality as compared to state-of-the-art routers.
• Score: 0.6117371161379208
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Global routing is a critical stage in electronic design automation (EDA) that enables early estimation and optimization of the routability of modern integrated circuits with respect to congestion, power dissipation, and design complexity. Batching is a primary concern in top-performing global routers, grouping nets into manageable sets to enable parallel processing and efficient resource usage. This process improves memory usage, scalable parallelization on modern hardware, and routing congestion by controlling net interactions within each batch. However, conventional batching methods typically depend on heuristics that are computationally expensive and can lead to suboptimal results (oversized batches with conflicting nets, excessive batch counts degrading parallelization, and longer batch generation times), ultimately limiting scalability and efficiency. To address these limitations, a novel batching algorithm enhanced with Wasserstein generative adversarial networks (WGANs) is introduced in this paper, enabling more effective parallelization by generating fewer higher-quality batches in less time. The proposed algorithm is tested on the latest ISPD'24 contest benchmarks, demonstrating up to 40% runtime reduction with only 0.002% degradation in routing quality as compared to state-of-the-art router.

Related papers

• Para-Pipe: Exploiting Hierarchical Operator Parallelism of ML Computational Graphs on SoCs [22.6523068033902]
  Para-Pipe is a hierarchical mapping framework that integrates intra- and inter-stage operator parallelism within a pipelined architecture.<n>Para-Pipe navigates the trade-off between throughput and latency by selectively fine-tuning parallelism levels within and across pipeline stages.
  arXiv  Detail & Related papers  (2026-09-03T17:53:44Z)
• Low-Energy Reduced RISC-V Instruction Subset Processor for Tsetlin Machine Inference at the Edge [1.2285549481077163]
  Tsetlin Machine (TM) is a logic-based machine learning approach that relies on simple bitwise operations and finite-state automata.<n>Recent work has focused on co-processor and accelerator designs based on TM.<n>We present a domain-specific RISC-V microprocessor architecture and design flow tailored for TM inference.
  arXiv  Detail & Related papers  (2026-06-18T09:05:41Z)
• Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing [0.0]
  In the Noisy Intermediate-Scale Quantum (NISQ) era, limited error rates directly constrain circuit fidelity.<n>We propose a framework the Digital Annealer (DA) via two strategies: (1) Hybrid, which uses DA-driven global initial mapping combined with high qu-speed routing by Qiskit, and (2) Full DA, which solves subproblems within an iterative workflow.<n>Our results indicate that for high-precision where gate noise is the primary bottleneck, DA-assisted global initial placement provides a practical "time-for-" tradeoff for enhancing the utility of near-term quantum hardware.
  arXiv  Detail & Related papers  (2026-05-12T04:19:51Z)
• A Multi-Stage Warm-Start Deep Learning Framework for Unit Commitment [0.6999740786886536]
  This paper proposes a novel framework to predict generator commitment schedules over a 72-hour horizon.<n>The proposed model reached a feasible operational schedule with a lower overall system cost than relying solely on the solver.
  arXiv  Detail & Related papers  (2026-04-23T17:44:02Z)
• Efficient and Interpretable Multi-Agent LLM Routing via Ant Colony Optimization [58.59491516762626]
  We propose AMRO-S, an efficient and interpretable routing framework for Multi-Agent Systems (MAS)<n>AMRO-S models MAS routing as a semantic-conditioned path selection problem, enhancing routing performance through three key mechanisms.<n>Extensive experiments on five public benchmarks and high-concurrency stress tests demonstrate that AMRO-S consistently improves the quality--cost trade-off over strong routing baselines.
  arXiv  Detail & Related papers  (2026-03-13T12:26:05Z)
• AdaFuse: Accelerating Dynamic Adapter Inference via Token-Level Pre-Gating and Fused Kernel Optimization [84.25316984309725]
  Integration of dynamic, sparse structures with parameter-efficient adapters (e.g., LoRA) is a powerful technique for enhancing Large Language Models (LLMs)<n>Despite minimal increases in computational load, the computation latency often skyrockets, leading to decoding speeds slowing by over 2.5 times.<n>AdaFuse is a framework built on a tight co-design between the algorithm and the underlying hardware system to enable efficient dynamic adapter execution.
  arXiv  Detail & Related papers  (2026-03-12T12:46:42Z)
• Blockchain-Enabled Routing for Zero-Trust Low-Altitude Intelligent Networks [77.17664010626726]
  We focus on the routing with multiple UAV clusters in low-altitude intelligent networks (LAINs)<n>To minimize the damage caused by potential threats, we present the zero-trust architecture with the software-defined perimeter and blockchain techniques.<n>We show that the proposed framework reduces the average E2E delay by 59% and improves the TSR by 29% on average compared to benchmarks.
  arXiv  Detail & Related papers  (2026-02-27T04:30:35Z)
• Implementation of high-efficiency, lightweight residual spiking neural network processor based on field-programmable gate arrays [0.49806798459446283]
  This work presents an efficient residual SNN accelerator that combines algorithm and hardware co-design to optimize inference energy efficiency.<n>The proposed processor achieves a classification accuracy of 87.11% on the CIFAR-10 dataset, with an inference time of 3.98 ms per image and an energy efficiency of 183.5 FPS/W.
  arXiv  Detail & Related papers  (2025-12-09T02:08:46Z)
• Eliminating Multi-GPU Performance Taxes: A Systems Approach to Efficient Distributed LLMs [61.953548065938385]
  We introduce the ''Three Taxes'' (Bulk Synchronous, Inter- Kernel Data Locality, and Kernel Launch Overhead) as an analytical framework.<n>We propose moving beyond the rigid BSP model to address key inefficiencies in distributed GPU execution.<n>We observe a 10-20% speedup in end-to-end latency over BSP-based approaches.
  arXiv  Detail & Related papers  (2025-11-04T01:15:44Z)
• Dependency-Aware Task Offloading in Multi-UAV Assisted Collaborative Mobile Edge Computing [53.88774113545582]
  This paper presents a novel multi-unmanned aerial vehicle (UAV) assisted collaborative mobile edge computing (MEC) framework.<n>It aims to minimize the system cost, and thus realize an improved trade-off between task consumption and energy consumption.<n>We show that the proposed scheme can significantly reduce the system cost, and thus realize an improved trade-off between task consumption and energy consumption.
  arXiv  Detail & Related papers  (2025-10-23T02:55:40Z)
• Swap Network Augmented Ansätze on Arbitrary Connectivity [0.0]
  We introduce an algorithm that optimize qubit routing for arbitrary connectivity graphs, resulting in a swap network that enables direct interactions between any pair of qubits.<n>We then propose a co-design of circuit layers and qubit routing by embedding the derived swap networks within layered, connectivity-aware ans"atze.<n>This construction significantly improves the trainability of the ansatz, leading to enhanced performance with reduced resources.
  arXiv  Detail & Related papers  (2025-07-31T15:56:28Z)
• AlphaRouter: Quantum Circuit Routing with Reinforcement Learning and Tree Search [14.46041554295883]
  This paper introduces a solution that integrates Monte Carlo Tree Search (MCTS) with Reinforcement Learning (RL) Our router, called Alpha RL, outperforms the current state-of-the-art routing methods and generates quantum programs with up to $20%$ less routing overhead.
  arXiv  Detail & Related papers  (2024-10-07T15:10:54Z)
• Optimal Parallelization Strategies for Active Flow Control in Deep Reinforcement Learning-Based Computational Fluid Dynamics [29.49913315698914]
  Deep Reinforcement Learning (DRL) has emerged as a promising approach for handling highly dynamic and nonlinear Active Flow Control (AFC) problems. This study focuses on optimizing DRL-based algorithms in parallel settings. We achieve a significant boost in parallel efficiency from around 49% to approximately 78%.
  arXiv  Detail & Related papers  (2024-02-18T09:07:30Z)
• Robust Path Selection in Software-defined WANs using Deep Reinforcement Learning [18.586260468459386]
  We propose a data-driven algorithm that does the path selection in the network considering the overhead of route computation and path updates. Our scheme fares well by a factor of 40% with respect to reducing link utilization compared to traditional TE schemes such as ECMP.
  arXiv  Detail & Related papers  (2022-12-21T16:08:47Z)
• Teal: Learning-Accelerated Optimization of WAN Traffic Engineering [68.7863363109948]
  We present Teal, a learning-based TE algorithm that leverages the parallel processing power of GPUs to accelerate TE control. To reduce the problem scale and make learning tractable, Teal employs a multi-agent reinforcement learning (RL) algorithm to independently allocate each traffic demand. Compared with other TE acceleration schemes, Teal satisfies 6--32% more traffic demand and yields 197--625x speedups.
  arXiv  Detail & Related papers  (2022-10-25T04:46:30Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers [112.23981192818721]
  We propose to use backward mode linear relaxation based analysis (LiRPA) to replace Linear Programming (LP) during the BaB process. Unlike LP, LiRPA when applied naively can produce much weaker bounds and even cannot check certain conflicts of sub-domains during splitting. We demonstrate an order of magnitude speedup compared to existing LP-based approaches.
  arXiv  Detail & Related papers  (2020-11-27T16:42:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.