Timing-Driven Placement for FPGA Architectures with Dedicated Routing Paths

被引:1
作者
Nikolic, Stefan [1 ]
Zgheib, Grace [2 ]
Ienne, Paolo [1 ]
机构
[1] Ecole Polytech Fed Lausanne EPFL, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland
[2] Intel Corp, San Jose, CA USA
来源
2020 30TH INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS (FPL) | 2020年
关键词
D O I
10.1109/FPL50879.2020.00035
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The idea of introducing dedicated, fast paths between certain FPGA elements in order to reduce delay is neither new nor particularly hard to come up with. What is less obvious, however, is how to put such paths to actual use. In this work, we propose an effective ILP-based detailed placer for FPGA architectures with direct connections between LUTs. We discuss various aspects of making such an approach practicable, from efficient formulation of the integer programs themselves, to focused application of the placer on specific portions of the circuit where it could have the greatest impact. These careful considerations allow us to simultaneously move tens of LUTs with tens of candidate positions each, in a matter of minutes. This more than doubles the advantage of additional connections on the critical path delay compared to the previously reported results that relied on architecture-oblivious placement algorithms.
引用
收藏
页码:153 / 161
页数:9
相关论文
共 19 条
[1]   A Parallel Branch-and-Cut Approach for Detailed Placement [J].
Cauley, Stephen ;
Balakrishnan, Venkataramanan ;
Hu, Y. Charlie ;
Koh, Cheng-Kok .
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2011, 16 (02)
[2]   Architectural Enhancements in Intel® Agilex™ FPGAs [J].
Chromczak, Jeffrey ;
Wheeler, Mark ;
Chiasson, Charles ;
How, Dana ;
Langhammer, Martin ;
Vanderhoek, Tim ;
Zgheib, Grace ;
Ganusov, Ilya .
2020 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE GATE ARRAYS (FPGA '20), 2020, :140-149
[3]  
Chung K. C. K., 1994, THESIS U TORONTO TOR THESIS U TORONTO TOR
[4]   Multi-Commodity Flow-Based Spreading in a Commercial Analytic Placer [J].
Darav, Nima Karimpour ;
Kennings, Andrew ;
Vorwerk, Kristofer ;
Kundu, Arun .
PROCEEDINGS OF THE 2019 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE GATE ARRAYS (FPGA'19), 2019, :122-131
[5]  
Dhar S, 2017, ISPD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN, P151
[6]  
Dhar Shounak., 2016, 2016 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), P1
[7]  
Feng WY, 2012, 2012 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (FPT'12), P8, DOI 10.1109/FPT.2012.6412103
[8]   Edge weight reduction problems in directed acyclic graphs [J].
Hambrusch, SE ;
Tu, HY .
JOURNAL OF ALGORITHMS, 1997, 24 (01) :66-93
[9]  
Hutton M., 2002, FPGA 2002. Tenth ACM International Symposium on Field-Programmable Gate Arrays, P3, DOI 10.1145/503048.503050
[10]   Routability-driven placement and white space allocation [J].
Li, Chen ;
Xie, Min ;
Koh, Cheng-Kok ;
Cong, Jason ;
Madden, Patrick H. .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2007, 26 (05) :858-871