ParaDiMe: A distributed memory FPGA router based on speculative parallelism and path encoding

Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/GutachtenBeitrag in KonferenzbandBeigetragenBegutachtung

Beitragende

Abstract

The increase in speed and capacity of FPGAs is faster than the development of effective design tools to fully utilize it, and routing of nets remains as one of the most time-consuming stages of the FPGA design flow. While existing works have proposed methods of accelerating routing through parallelization, they are limited by the memory architecture of the system that they target. In this paper, we propose a distributed memory parallel FPGA router called ParaDiMe to address the limitations of existing works. ParaDiMe speculatively routes net in parallel and dynamically detects the need to reduce the number of active processes in order to achieve convergence. In addition, the synchronization overhead in ParaDiMe is significantly reduced through a careful design of the messaging protocol where paths to sinks are encoded in a space-efficient manner. Moreover, the frequency of synchronization is tuned to ensure convergence while minimizing the communication overhead. Compared to VTR, ParaDiMe achieves an average speedup of 19.8X with 32 processes while producing similar quality of results.

Details

OriginalspracheEnglisch
TitelProceedings - IEEE 25th Annual International Symposium on Field-Programmable Custom Computing Machines, FCCM 2017
Herausgeber (Verlag)IEEE, New York [u. a.]
Seiten172-179
Seitenumfang8
ISBN (elektronisch)9781538640364
PublikationsstatusVeröffentlicht - 30 Juni 2017
Peer-Review-StatusJa

Publikationsreihe

ReiheAnnual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM)

Konferenz

Titel25th Annual IEEE International Symposium on Field-Programmable Custom Computing Machines, FCCM 2017
Dauer30 April - 2 Mai 2017
StadtNapa
LandUSA/Vereinigte Staaten