EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/2033

Title: Hybrid Multi-FPGA board evaluation by limiting multi-hop routing
Authors: Jain, S C
A Kumar
S Kumar
Keywords: multi-FPGA boards
field-programmable interconnect device
multi-hop router
Issue Date: 2002
Citation: Rapid System Prototyping, Proceedings 13th IEEE International Workshop on, 66 - 73p.
Abstract: Multi-FPGA Boards (MFBs) have been in use for more than a decade for emulation of the digital circuits in many applications. Key feature of an MFB architecture is its inter-FPGA connections. There are two types of inter-FPGA connections namely: i) fixed connection (FC)-connecting a pair of FPGAs through a dedicated wire between them, ii) programmable connection (PC)-connecting a pair of FPGAs through a programmable switch like Field-Programmable Interconnect Device (FPID). Hence, a PC requires two wires compared to one wire in FC. Khalid et al. (1999) have shown that the MFBs consisting of both the types of connections (hybrid MFBs) are better than other architectures for emulation of the circuits, if the number of PCs are minimum required. Hence, we evaluate the hybrid MFBs for the required number of PCs as an evaluation metric. Availability of technology mapping, partitioning, embedding and routing tools is another important requirement for emulation. A routing tool (multi-hop router) prefers one or more unused FCs (multi-hops) in lieu of one PC. Available multihop routers are specific to MFB architecture and use unlimited hops in the routes. For evaluation, a generic multi-hop router for any hybrid architecture is required which obeys the given limit on maximum number of hops in every route. This paper presents the development of routing tool for the same. A heuristic, a lower bound and an optimal algorithm has been implemented for this purpose. For the test cases, it has been observed that the optimal results (within 3 hours) are achievable by the heuristic (within a minute). Also the results are more precise than the available results.
URI: http://eprint.iitd.ac.in/dspace/handle/2074/2033
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
jainhyb2002.pdf120.51 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback