On Joint Learning for Solving Placement and Routing in Chip Design

• URL: http://arxiv.org/abs/2111.00234v1
• Date: Sat, 30 Oct 2021 11:41:49 GMT
• Title: On Joint Learning for Solving Placement and Routing in Chip Design
• Authors: Ruoyu Cheng, Junchi Yan
• Abstract summary: 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.
• Score: 70.30640973026415
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For its advantage in GPU acceleration and less dependency on human experts, machine learning has been an emerging tool for solving the placement and routing problems, as two critical steps in modern chip design flow. Being still in its early stage, there are fundamental issues: scalability, reward design, and end-to-end learning paradigm etc. To achieve end-to-end placement learning, we first propose a joint learning method termed by DeepPlace for the placement of macros and standard cells, by the integration of reinforcement learning with a gradient based optimization scheme. To further bridge the placement with the subsequent routing task, we also develop a joint learning approach via reinforcement learning to fulfill both macro placement and routing, which is called DeepPR. One key design in our (reinforcement) learning paradigm involves a multi-view embedding model to encode both global graph level and local node level information of the input macros. Moreover, the random network distillation is devised to encourage exploration. Experiments on public chip design benchmarks show that our method can effectively learn from experience and also provides intermediate placement for the post standard cell placement, within few hours for training.

Related papers

• Chip Placement with Diffusion [42.397340832801724]
  Macro placement defines the physical location of large collections of components, known as macros, on a 2-dimensional chip. Existing learning-based methods fall short because of their reliance on reinforcement learning, which is slow and limits the flexibility of the agent. We propose a novel architecture for the denoising model, as well as an algorithm to generate large synthetic datasets for pre-training. We empirically show that our model can tackle the placement task, and achieve competitive performance on placement benchmarks compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-07-17T03:02:24Z)
• Robust Decentralized Learning with Local Updates and Gradient Tracking [16.46727164965154]
  We consider decentralized learning as a network of communicating clients or nodes. We propose a decentralized minimax optimization method that employs two important data: local updates and gradient tracking.
  arXiv  Detail & Related papers  (2024-05-02T03:03:34Z)
• Set-to-Sequence Ranking-based Concept-aware Learning Path Recommendation [49.85548436111153]
  We propose a novel framework named Set-to-Sequence Ranking-based Concept-aware Learning Path Recommendation (SRC) SRC formulates the recommendation task under a set-to-sequence paradigm. We conduct extensive experiments on two real-world public datasets and one industrial dataset.
  arXiv  Detail & Related papers  (2023-06-07T08:24:44Z)
• Towards Machine Learning for Placement and Routing in Chip Design: a Methodological Overview [72.79089075263985]
  Placement and routing are two indispensable and challenging (NP-hard) tasks in modern chip design flows. Machine learning has shown promising prospects by its data-driven nature, which can be of less reliance on knowledge and priors.
  arXiv  Detail & Related papers  (2022-02-28T06:28:44Z)
• 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)
• Incentive Mechanism Design for Resource Sharing in Collaborative Edge Learning [106.51930957941433]
  In 5G and Beyond networks, Artificial Intelligence applications are expected to be increasingly ubiquitous. This necessitates a paradigm shift from the current cloud-centric model training approach to the Edge Computing based collaborative learning scheme known as edge learning.
  arXiv  Detail & Related papers  (2020-05-31T12:45:06Z)
• Cross-Domain Few-Shot Learning with Meta Fine-Tuning [8.062394790518297]
  We tackle the new Cross-Domain Few-Shot Learning benchmark proposed by the CVPR 2020 Challenge. We build upon state-of-the-art methods in domain adaptation and few-shot learning to create a system that can be trained to perform both tasks.
  arXiv  Detail & Related papers  (2020-05-21T09:55:26Z)
• MetricUNet: Synergistic Image- and Voxel-Level Learning for Precise CT Prostate Segmentation via Online Sampling [66.01558025094333]
  We propose a two-stage framework, with the first stage to quickly localize the prostate region and the second stage to precisely segment the prostate. We introduce a novel online metric learning module through voxel-wise sampling in the multi-task network. Our method can effectively learn more representative voxel-level features compared with the conventional learning methods with cross-entropy or Dice loss.
  arXiv  Detail & Related papers  (2020-05-15T10:37:02Z)
• Chip Placement with Deep Reinforcement Learning [40.952111701288125]
  We present a learning-based approach to chip placement. Unlike prior methods, our approach has the ability to learn from past experience and improve over time. In under 6 hours, our method can generate placements that are superhuman or comparable on modern accelerator netlists.
  arXiv  Detail & Related papers  (2020-04-22T17:56:07Z)

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.