ChiPFormer: Transferable Chip Placement via Offline Decision Transformer
- URL: http://arxiv.org/abs/2306.14744v2
- Date: Tue, 1 Aug 2023 11:42:22 GMT
- Title: ChiPFormer: Transferable Chip Placement via Offline Decision Transformer
- Authors: Yao Lai, Jinxin Liu, Zhentao Tang, Bin Wang, Jianye Hao, Ping Luo
- Abstract summary: 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.
- Score: 35.69382855465161
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Placement is a critical step in modern chip design, aiming to determine the
positions of circuit modules on the chip canvas. Recent works have shown that
reinforcement learning (RL) can improve human performance in chip placement.
However, such an RL-based approach suffers from long training time and low
transfer ability in unseen chip circuits. To resolve these challenges, we cast
the chip placement as an offline RL formulation and present ChiPFormer that
enables learning a transferable placement policy from fixed offline data.
ChiPFormer has several advantages that prior arts do not have. First,
ChiPFormer can exploit offline placement designs to learn transferable policies
more efficiently in a multi-task setting. Second, ChiPFormer can promote
effective finetuning for unseen chip circuits, reducing the placement runtime
from hours to minutes. Third, extensive experiments on 32 chip circuits
demonstrate that ChiPFormer achieves significantly better placement quality
while reducing the runtime by 10x compared to recent state-of-the-art
approaches in both public benchmarks and realistic industrial tasks. The
deliverables are released at https://sites.google.com/view/chipformer/home.
Related papers
- Benchmarking End-To-End Performance of AI-Based Chip Placement Algorithms [77.71341200638416]
ChiPBench is a benchmark designed to evaluate the effectiveness of AI-based chip placement algorithms.
We have gathered 20 circuits from various domains (e.g., CPU, GPU, and microcontrollers) for evaluation.
Results show that even if intermediate metric of a single-point algorithm is dominant, the final PPA results are unsatisfactory.
arXiv Detail & Related papers (2024-07-03T03:29:23Z) - Evaluating Vulnerability of Chiplet-Based Systems to Contactless Probing Techniques [2.8823932597429205]
We evaluate the exposure of chiplets to probing by applying laser contactless probing techniques to a chiplet-based AMD/Xilinx VU9P FPGA.
We identify and map interposer wire drivers and show that probing them is easier compared to probing internal nodes.
arXiv Detail & Related papers (2024-05-23T17:38:13Z) - Chiplet Placement Order Exploration Based on Learning to Rank with Graph Representation [0.3305234744011984]
The adoption of reinforcement learning as a sequential placement method has introduced a new challenge in determining the optimal placement order for each chiplet.
We propose a learning to rank approach with graph representation, building upon the reinforcement learning framework RLPlanner.
Experimental results demonstrate that utilizing the placement order obtained from the learning to rank network leads to further improvements in system temperature and inter-chiplet wirelength.
arXiv Detail & Related papers (2024-04-07T12:40:37Z) - Cost Explosion for Efficient Reinforcement Learning Optimisation of
Quantum Circuits [55.616364225463066]
Reinforcement Learning (RL) is a recent approach for learning strategies to optimise quantum circuits by increasing the reward of an optimisation agent.
Our goal is to improve the agent's optimization strategy, by including hints about how quantum circuits are optimized manually.
We show that allowing cost explosions offers significant advantages for RL training, such as reaching optimum circuits.
arXiv Detail & Related papers (2023-11-21T10:16:03Z) - Action-Quantized Offline Reinforcement Learning for Robotic Skill
Learning [68.16998247593209]
offline reinforcement learning (RL) paradigm provides recipe to convert static behavior datasets into policies that can perform better than the policy that collected the data.
In this paper, we propose an adaptive scheme for action quantization.
We show that several state-of-the-art offline RL methods such as IQL, CQL, and BRAC improve in performance on benchmarks when combined with our proposed discretization scheme.
arXiv Detail & Related papers (2023-10-18T06:07:10Z) - 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) - Routing and Placement of Macros using Deep Reinforcement Learning [0.0]
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.
arXiv Detail & Related papers (2022-05-19T02:40:58Z) - GDP: Stabilized Neural Network Pruning via Gates with Differentiable
Polarization [84.57695474130273]
Gate-based or importance-based pruning methods aim to remove channels whose importance is smallest.
GDP can be plugged before convolutional layers without bells and whistles, to control the on-and-off of each channel.
Experiments conducted over CIFAR-10 and ImageNet datasets show that the proposed GDP achieves the state-of-the-art performance.
arXiv Detail & Related papers (2021-09-06T03:17:10Z) - 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.