Large Reasoning Models for 3D Floorplanning in EDA: Learning from Imperfections

Fin Amin, Nirjhor Rouf, Tse-Han Pan, Md Kamal Ibn Shafi, Paul D. Franzon
6/15/2024
cs.LGcs.CE

No confident code implementation found for this paper.

Abstract

In this paper, we introduce Dreamweaver, which belongs to a new class of auto-regressive decision-making models known as large reasoning models (LRMs). Dreamweaver is designed to improve 3D floorplanning in electronic design automation (EDA) via an architecture that melds advancements in sequence-to-sequence reinforcement learning algorithms. A significant advantage of our approach is its ability to effectively reason over large discrete action spaces, which is essential for handling the numerous potential positions for various functional blocks in floorplanning. Additionally, Dreamweaver demonstrates strong performance even when trained on entirely random trajectories, showcasing its capacity to leverage sub-optimal or non-expert trajectories to enhance its results. This innovative approach contributes to streamlining the integrated circuit (IC) design flow and reducing the high computational costs typically associated with floorplanning. We evaluate its performance against a current state-of-the-art method, highlighting notable improvements.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{amin2024large,
  title  = {Large Reasoning Models for 3D Floorplanning in EDA: Learning from Imperfections},
  author = {Fin Amin and Nirjhor Rouf and Tse-Han Pan and Md Kamal Ibn Shafi and Paul D. Franzon},
  year   = {2024},
  eprint = {2406.10538},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.10538v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.10538.svg)](https://codeofpaper.com/paper/2406.10538)

Discussion