Routing and Placement of Macros using Deep Reinforcement Learning

• URL: http://arxiv.org/abs/2205.09289v1
• Date: Thu, 19 May 2022 02:40:58 GMT
• Title: Routing and Placement of Macros using Deep Reinforcement Learning
• Authors: Mrinal Mathur
• Abstract summary: We train a model to place the nodes of a chip netlist onto a chip canvas. We want to build a neural architecture that will accurately reward the agent across a wide variety of input netlist correctly.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Chip placement has been one of the most time consuming task in any semi conductor area, Due to this negligence, many projects are pushed and chips availability in real markets get delayed. An engineer placing macros on a chip also needs to place it optimally to reduce the three important factors like power, performance and time. Looking at these prior problems we wanted to introduce a new method using Reinforcement Learning where we train the model to place the nodes of a chip netlist onto a chip canvas. We want to build a neural architecture that will accurately reward the agent across a wide variety of input netlist correctly.

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)
• ChiPFormer: Transferable Chip Placement via Offline Decision Transformer [35.69382855465161]
  reinforcement learning can improve human performance in chip placement. ChiPFormer enables learning a transferable placement policy from fixed offline data. ChiPFormer achieves significantly better placement quality while reducing the runtime by 10x.
  arXiv  Detail & Related papers  (2023-06-26T14:59:56Z)
• Fast GraspNeXt: A Fast Self-Attention Neural Network Architecture for Multi-task Learning in Computer Vision Tasks for Robotic Grasping on the Edge [80.88063189896718]
  High architectural and computational complexity can result in poor suitability for deployment on embedded devices. Fast GraspNeXt is a fast self-attention neural network architecture tailored for embedded multi-task learning in computer vision tasks for robotic grasping.
  arXiv  Detail & Related papers  (2023-04-21T18:07:14Z)
• MaskPlace: Fast Chip Placement via Reinforced Visual Representation Learning [18.75057105112443]
  This work presents MaskPlace to automatically generate a valid chip layout design within a few hours. It recasts placement as a problem of learning pixel-level visual representation to comprehensively describe millions of modules on a chip. It outperforms recent methods that represent a chip as a hypergraph.
  arXiv  Detail & Related papers  (2022-11-24T02:22:09Z)
• 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)
• FPGA-optimized Hardware acceleration for Spiking Neural Networks [69.49429223251178]
  This work presents the development of a hardware accelerator for an SNN, with off-line training, applied to an image recognition task. The design targets a Xilinx Artix-7 FPGA, using in total around the 40% of the available hardware resources. It reduces the classification time by three orders of magnitude, with a small 4.5% impact on the accuracy, if compared to its software, full precision counterpart.
  arXiv  Detail & Related papers  (2022-01-18T13:59:22Z)
• 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)
• Multi-Exit Semantic Segmentation Networks [78.44441236864057]
  We propose a framework for converting state-of-the-art segmentation models to MESS networks. specially trained CNNs that employ parametrised early exits along their depth to save during inference on easier samples. We co-optimise the number, placement and architecture of the attached segmentation heads, along with the exit policy, to adapt to the device capabilities and application-specific requirements.
  arXiv  Detail & Related papers  (2021-06-07T11:37:03Z)
• 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.