This repository contains the data and software needed to reproduce the results from the paper "Guaranteed Yet Hard to Find: Uncovering FPGA Routing Convergence Paradox" by Shashwat Shrivastava (EPFL), Stefan Nikolić (University of Novi Sad), Sun Tanaka (University of Tokyo),  Chirag Ravishankar (AMD), Dinesh Gaitonde (AMD), and Mirjana Stojilović (EPFL). The paper has been accepted for publication in the Proceedings of the 33rd IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM 2025).

The README file details the repository's structure, contents, and instructions for using the provided software and data.

Abstract:

Routing is one of the major challenges of FPGA compilation. PathFinder is a ubiquitous FPGA routing algorithm used in industry and academia thanks to its ability to adapt to arbitrary routing architectures and user circuits. However, to this day, we do not completely understand why PathFinder works so well and what its limitations are. When a circuit fails to route, it is difficult to pinpoint the problem: architecture or algorithm. Usually, in such cases, either PathFinder is fine-tuned or routing resources are added in the architecture to improve routability, ignoring the exploration of inherent inefficiencies that may exist in PathFinder and further preventing us from designing siliconefficient architectures. In this work, to pinpoint the problem, we construct constrained routing problems where nets have access to limited but specific routing resources that guarantee a legal routing solution. Yet, even with a state-of-the-art implementation, PathFinder fails to find the existing routing solution or any other solution for that matter, highlighting issues in PathFinder solely. The reduced search space makes the underlying behavior more accessible for analysis and reasoning, allowing us to uncover the inefficiency in the current paradigm of PathFinder and propose a solution to fix it. We then transfer the learnings from the constrained to the standard setting, where the search space is not reduced, to show the potential benefits that could be achieved.