Abstract
Multi-FPGA boards(MFBs) are extensively used by the designers for logic emulation, rapid prototyping, custom computing and low volume sub-system implementation. Efficient use of an MFB does not only require a good routing topology, but also a good set of CAD tools to partition the given circuits and embed them on the MFB. Khalid et al[1] have shown that among the MFB topologies, hybrid series of architectures containing fixed FPGA-FPGA connections and programmable connections through Field Programmable Interconnect Devices(FPIDs) are better than other architectures. Programmable connections can connect different pairs of FPGAs under program control, but require additional wires, extra delays etc. compared to fixed connection.
An MFB, to be used in rapid prototyping, is expected to emulate a large number of digital circuits. To accommodate the routing requirement generated by partitioning them, MFB is required to have significantly large number of programmable connections. In this paper, we have shown that an efficient embedding tool can substantially reduce the requirement of programmable connections. The paper presents an optimal as well as a fast heuristic for embedding. Our methods can work with a large class of hybrid routing topologies.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Mohammed A.S. Khalid, Routing Architecture and Layout Synthesis for Multi-FPGA Systems, Ph.D. thesis, University of Toronto, Department of Electrical and Computer Engineering, University of Toronto, 10 King’s College Road, Toronto, Ontario Canada M5S 3G4, 1999.
Scott Hauck, Multi-FPGA Systems, Ph.D. thesis, University of Washington, Deptt of Comp Sc and Engg, Univ of Washington, Seatle, 1995.
J. Babb et al, “Logic Emulation with Virtual Wires,” IEEE Trans. on CAD, vol. 16, no. 6, pp. 609–626, June 1997.
K. Roy-Neogi and C. Sechan, “Multiple-FPGA Partitioning with Performance Optimization,” International Symposium on FPGAs, pp. 146–152, 1995.
Panos M. Pardalos, Franz Rendl and Henry Wolkowicz, “The Quadratic Assignment Problem: A Survey and Recent Developments,” American Mathematical Society Publications — DIMACS Volume Series, vol. 16, 1994.
S. Yang, “Logic Synthesis and Optimization Benchmarks User Guide Version 3.0,” Microelectronics Centre of North Carolina, January 1991.
Cong, J. and Y. Ding, “FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs,” IEEE Trans. on Computer-Aided Design, vol. 13, no. 1, pp. 1–12, 1994.
M. Hutton et al, “Characterization and Parameterized Random Generation of Digital Circuits,” Proceedings of the DAC, Las Vegas, pp. 94–99, 1996.
George Karypis and Vipin Kumar, “hMETIS* — A Hypergraph Partitioning Package Version 1.5.3,” Computer Science Dept.,University of Minnesota, Minnepolis, MN 55455, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S.C., Kumar, A., Kumar, S. (2000). Efficient Embedding of Partitioned Circuits onto Multi-FPGA Boards. In: Hartenstein, R.W., Grünbacher, H. (eds) Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing. FPL 2000. Lecture Notes in Computer Science, vol 1896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44614-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-44614-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67899-1
Online ISBN: 978-3-540-44614-9
eBook Packages: Springer Book Archive