Non-Overlapping Placement of Macro Cells based on Reinforcement Learning in Chip Design

• URL: http://arxiv.org/abs/2407.18499v3
• Date: Sun, 29 Sep 2024 09:41:30 GMT
• Title: Non-Overlapping Placement of Macro Cells based on Reinforcement Learning in Chip Design
• Authors: Tao Yu, Peng Gao, Fei Wang, Ru-Yue Yuan,
• Abstract summary: This paper proposes an end-to-end placement method, SRLPlacer, based on reinforcement learning. By assessing on the public benchmark ISPD2005, the proposed SRLPlacer can effectively solve the overlap problem between macro cells.
• Score: 20.500468654567033
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Due to the increasing complexity of chip design, existing placement methods still have many shortcomings in dealing with macro cells coverage and optimization efficiency. Aiming at the problems of layout overlap, inferior performance, and low optimization efficiency in existing chip design methods, this paper proposes an end-to-end placement method, SRLPlacer, based on reinforcement learning. First, the placement problem is transformed into a Markov decision process by establishing the coupling relationship graph model between macro cells to learn the strategy for optimizing layouts. Secondly, the whole placement process is optimized after integrating the standard cell layout. By assessing on the public benchmark ISPD2005, the proposed SRLPlacer can effectively solve the overlap problem between macro cells while considering routing congestion and shortening the total wire length to ensure routability. Codes are available at https://github.com/zhouyusd/SRLPlacer.

Related papers

• A Markovian Framing of WaveFunctionCollapse for Procedurally Generating Aesthetically Complex Environments [5.114029940159893]
  Procedural content generation often requires satisfying both designer-specified objectives and adjacency constraints implicitly imposed by the underlying tile set.<n>We reformulate WaveFunctionCol (WFC) as a Markov Decision Process (MDP)<n>We find that joint optimization not only struggles as task complexity increases, but consistently underperforms relative to optimization over the WFC-MDP.
  arXiv  Detail & Related papers  (2025-09-12T01:51:01Z)
• A Gradient Meta-Learning Joint Optimization for Beamforming and Antenna Position in Pinching-Antenna Systems [63.213207442368294]
  We consider a novel optimization design for multi-waveguide pinching-antenna systems.<n>The proposed GML-JO algorithm is robust to different choices and better performance compared with the existing optimization methods.
  arXiv  Detail & Related papers  (2025-06-14T17:35:27Z)
• CLCR: Contrastive Learning-based Constraint Reordering for Efficient MILP Solving [34.127805466651864]
  Constraint ordering plays a critical role in the efficiency of Mixed-Integer Linear Programming (MILP) solvers. This paper introduces CLCR (Contrastive Learning-based Constraint Reordering), a novel framework that systematically optimize constraint ordering to accelerate MILP solving. Experiments on benchmarks show CLCR reduces solving time by 30% and LP iterations by 25% on average, without sacrificing solution accuracy.
  arXiv  Detail & Related papers  (2025-03-23T05:01:43Z)
• TransPlace: Transferable Circuit Global Placement via Graph Neural Network [24.43651668384556]
  This study presents TransPlace, a global placement framework that learns to place complexity of mixed-size cells in continuous space. Compared to state-of-the-art placement methods, TransPlace-trained on a few high-quality placements-can place unseen circuits with 1.2x speedup.
  arXiv  Detail & Related papers  (2025-01-10T02:33:15Z)
• Learning for Cross-Layer Resource Allocation in MEC-Aided Cell-Free Networks [71.30914500714262]
  Cross-layer resource allocation over mobile edge computing (MEC)-aided cell-free networks can sufficiently exploit the transmitting and computing resources to promote the data rate. Joint subcarrier allocation and beamforming optimization are investigated for the MEC-aided cell-free network from the perspective of deep learning.
  arXiv  Detail & Related papers  (2024-12-21T10:18:55Z)
• Reinforcement Learning Policy as Macro Regulator Rather than Macro Placer [22.46061028295081]
  reinforcement learning has emerged as a promising technique for improving placement quality. Current RL-based placement methods suffer from long training times, low generalization ability, and inability to guarantee PPA results. We propose an approach that utilizes RL for the refinement stage, which allows the RL policy to learn how to adjust existing placement layouts. We evaluate our approach on the ISPD 2005 and ICCAD 2015 benchmark, comparing the global half-perimeter wirelength and regularity of our proposed method against several competitive approaches.
  arXiv  Detail & Related papers  (2024-12-10T04:01:21Z)
• Large Language Model (LLM) for Standard Cell Layout Design Optimization [2.012607314686814]
  We use Large Language Model (LLM) to generate high-quality cluster constraints incrementally to optimize the cell layout PPA and debug the routability with ReAct prompting. On a benchmark of sequential standard cells in 2nm, we demonstrate that the proposed method achieves up to 19.4% smaller cell area. In summary, the proposed method not only successfully reduces cell area by 4.65% on average, but also is able to fix routability in the cell layout designs.
  arXiv  Detail & Related papers  (2024-05-24T04:59:58Z)
• Distributed Evolution Strategies with Multi-Level Learning for Large-Scale Black-Box Optimization [13.750841199401613]
  We propose to parallelize the well-established covariance matrix adaptation evolution strategy (CMA-ES) and in particular its one latest LSO variant called limited-memory CMA-ES (LM-CMA) We present a multilevel learning-based meta-framework for distributed LM-CMA. Owing to its hierarchically organized structure, Meta-ES is well-suited to implement our distributed meta-framework.
  arXiv  Detail & Related papers  (2023-10-09T03:24:51Z)
• Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration [87.53543137162488]
  We propose an easy-to-implement online reinforcement learning (online RL) framework called textttMEX. textttMEX integrates estimation and planning components while balancing exploration exploitation automatically. It can outperform baselines by a stable margin in various MuJoCo environments with sparse rewards.
  arXiv  Detail & Related papers  (2023-05-29T17:25:26Z)
• Bayesian Optimization for Macro Placement [48.55456716632735]
  We develop a novel approach to macro placement using Bayesian optimization (BO) over sequence pairs. BO is a machine learning technique that uses a probabilistic surrogate model and an acquisition function. We demonstrate our algorithm on the fixed-outline macro placement problem with the half-perimeter wire length objective.
  arXiv  Detail & Related papers  (2022-07-18T06:17:06Z)
• Squeezeformer: An Efficient Transformer for Automatic Speech Recognition [99.349598600887]
  Conformer is the de facto backbone model for various downstream speech tasks based on its hybrid attention-convolution architecture. We propose the Squeezeformer model, which consistently outperforms the state-of-the-art ASR models under the same training schemes.
  arXiv  Detail & Related papers  (2022-06-02T06:06:29Z)
• A Transferable Approach for Partitioning Machine Learning Models on Multi-Chip-Modules [8.224904698490626]
  Multi-Chip-Modules (MCMs) reduce the design and fabrication cost of machine learning accelerators. We present a strategy using a deep reinforcement learning framework to emit a possibly invalid candidate partition that is then corrected by a constraint solver. Our evaluation of a production-scale model, BERT, on real hardware reveals that the partitioning generated using RL policy achieves 6.11% and 5.85% higher throughput.
  arXiv  Detail & Related papers  (2021-12-07T23:40:28Z)
• On Joint Learning for Solving Placement and Routing in Chip Design [70.30640973026415]
  We propose a joint learning method by DeepPlace for the placement of macros and standard cells. We also develop a joint learning approach via reinforcement learning to fulfill both macro placement and routing, which is called DeepPR. Our method can effectively learn from experience and also provides intermediate placement for the post standard cell placement, within few hours for training.
  arXiv  Detail & Related papers  (2021-10-30T11:41:49Z)
• Meta-Learning with Neural Tangent Kernels [58.06951624702086]
  We propose the first meta-learning paradigm in the Reproducing Kernel Hilbert Space (RKHS) induced by the meta-model's Neural Tangent Kernel (NTK) Within this paradigm, we introduce two meta-learning algorithms, which no longer need a sub-optimal iterative inner-loop adaptation as in the MAML framework. We achieve this goal by 1) replacing the adaptation with a fast-adaptive regularizer in the RKHS; and 2) solving the adaptation analytically based on the NTK theory.
  arXiv  Detail & Related papers  (2021-02-07T20:53:23Z)
• Reconfigurable Intelligent Surface Assisted Mobile Edge Computing with Heterogeneous Learning Tasks [53.1636151439562]
  Mobile edge computing (MEC) provides a natural platform for AI applications. We present an infrastructure to perform machine learning tasks at an MEC with the assistance of a reconfigurable intelligent surface (RIS) Specifically, we minimize the learning error of all participating users by jointly optimizing transmit power of mobile users, beamforming vectors of the base station, and the phase-shift matrix of the RIS.
  arXiv  Detail & Related papers  (2020-12-25T07:08:50Z)

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.