Efficient embedding of partitioned circuits onto multi-FPGA boards

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Chandra Jain, S., Kumar, A., & Kumar, S. (2000). Efficient embedding of partitioned circuits onto multi-FPGA boards. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1896, pp. 201–210). Springer Verlag. https://doi.org/10.1007/3-540-44614-1_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free