FPGA Divide-and-Conquer Placement using Deep Reinforcement Learning

Shang Wang, Deepak Ranganatha Sastry Mamillapalli, Tianpei Yang, Matthew E. Taylor
4/11/2024
cs.ARcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

This paper introduces the problem of learning to place logic blocks in Field-Programmable Gate Arrays (FPGAs) and a learning-based method. In contrast to previous search-based placement algorithms, we instead employ Reinforcement Learning (RL) with the goal of minimizing wirelength. In addition to our preliminary learning results, we also evaluated a novel decomposition to address the nature of large search space when placing many blocks on a chipboard. Empirical experiments evaluate the effectiveness of the learning and decomposition paradigms on FPGA placement tasks.

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{wang2024fpga,
  title  = {FPGA Divide-and-Conquer Placement using Deep Reinforcement Learning},
  author = {Shang Wang and Deepak Ranganatha Sastry Mamillapalli and Tianpei Yang and Matthew E. Taylor},
  year   = {2024},
  eprint = {2404.13061},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.13061v1}
}

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/2404.13061.svg)](https://codeofpaper.com/paper/2404.13061)

Discussion