Wai-Kei Mak
ABSTRACT
We consider the placement of FPGA designs with multiple I/O standards on modern FPGAs that support multiple I/O standards. We propose an efficient approach to solve the constrained I/O placement problem by 0-1 integer linear programming within a high performance placement flow. We derive an elegant 0-1 integer linear program formulation which is applicable not only for devices with symmetric I/O banks but also for devices with asymmetric I/O banks (i.e., different banks may have different sizes and/or support different subsets of I/O standards). Moreover, it is capable of handling user's pre-locked I/Os. We also show that additional restrictions such as conditional usage of Vref pins can be easily incorporated. Our formulation involves only a small number of 0-1 integer variables independent of the device size or the number of I/O objects, hence our approach can comfortably handle very large problem instances. Extensive experimentation showed that the 0-1 integer linear program corresponding to a feasible instance of the constrained I/O placement problem can be solved in seconds.
- Altera Corp., 'Using Selectable I/O Standards in Cyclone Devices", Application Note 253, Sept. 2002.]]Google Scholar
- Altera Corp., 'Using Selectable I/O Standards in Mercury Devices", Application Note 134, Dec. 2002.]]Google Scholar
- Altera Corp., 'Using Selectable I/O Standards in Stratix & Stratix GX Devices", Application Note 201, Dec. 2002.]]Google Scholar
- J. Anderson, J. Saunders, S. Nag, C. Madabhushi, and R. Jayaraman, "A Placement Algorithm for FPGA Designs with Multiple I/O Standards", in Proc. of Int'l Conf. on Field-Programmable Logic and Applications, Lecture Notes in Computer Science 1896 (R.W. Hartenstein and H. Grünbacher, eds.), pp. 211--220, Springer-Verlag, Berlin, 2000.]] Google ScholarDigital Library
- M. Berkelaar, lp_solve, available by anonymous ftp from ftp://ftp.es.ele.tue.nl/pub/lp_solve.]]Google Scholar
- G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, N.J., 1963.]]Google Scholar
- H. A. Eiselt and C. L. Sandblom, Integer Programming and Network Models, Springer-Verlag, Berlin, 2000.]]Google ScholarCross Ref
- W. K. Mak, "I/O Placement for FPGAs with Multiple I/O Standards", in Proc. of ACM Int'l Symp. on Field-Programmable Gate Arrays, pp. 51--57, Feb. 2003.]] Google ScholarDigital Library
- Xilinx Inc., 'Using Select I/O Interfaces in Spartan II and Spartan-IIE FPGAs", Application Note 179, July, 2002.]]Google Scholar
- Xilinx Inc., 'Spartan-3 1.2V Field Programmable Gate Arrays", Advance Product Specification, March 2004.]]Google Scholar
- Xilinx Inc., "Virtex#8482; 2.5V/Virtex#8482;-E 1.8/Virtex-II 1.5V Field Programmable Gate Arrays", Product Data Sheet, July 2002.]]Google Scholar
- Xilinx Inc., Virtex-II Pro Platform FPGA Handbook, version 1.0, Jan. 2002.]]Google Scholar
Recommendations
Handling complexities in modern large-scale mixed-size placement
DAC '09: Proceedings of the 46th Annual Design Automation ConferenceIn this paper, we propose an effective algorithm flow to handle large-scale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the global level. The flow consists of four steps: 1) The objects in the ...
An Analytical-based Hybrid Algorithm for FPGA Placement
GLSVLSI '19: Proceedings of the 2019 on Great Lakes Symposium on VLSIAs the capacity of FPGA increases, FPGA placers that adopt Simulated Annealing (SA) algorithm take more and more runtime. To solve this problem, this paper presents HCAS, a Hybrid algorithm Combining Analytical method and SA. There are three ...
Constrained "Modern" Floorplanning
ISPD '03: Proceedings of the 2003 international symposium on Physical designThis paper presents algorithms for a constrained version of the "modern" floorplanning problem proposed by Kahng in "Classical Floorplanning Harmful?" [1]. Specically, the constrained modern floorplanning problem (CMFP) is suitable when die-size is ...
Comments