Title :
Mesh routing topologies for multi-FPGA systems
Author :
Hauck, Scott ; Borriello, Gaetano ; Ebeling, Carl
Author_Institution :
Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
Abstract :
There is currently great interest in using fixed arrays of FPGAs for logic emulators, custom computing devices, and software accelerators. An important part of designing such a system is determining the proper routing topology to use to interconnect the FPGAs. This topology can have a great effect on the area and delay of the resulting system. Tree, bipartite graph, and mesh inter-connection schemes have all been proposed for use in FPGA-based systems. In this paper we examine mesh interconnection schemes, and propose several constructs for more efficient topologies. These reduce inter-chip delays by more than 60% over the basic 4-way Mesh
Keywords :
delays; graph theory; logic arrays; logic design; network routing; trees (mathematics); 4-way Mesh; area; bipartite graph; custom computing devices; delay; fixed arrays; inter-chip delays; logic emulators; mesh inter-connection schemes; mesh interconnection schemes; mesh routing topologies; multi-FPGA systems; routing topology; software accelerators; tree; Bipartite graph; Circuit simulation; Delay; Field programmable gate arrays; Integrated circuit interconnections; Logic arrays; Logic design; Network topology; Routing; Tree graphs;
Conference_Titel :
Computer Design: VLSI in Computers and Processors, 1994. ICCD '94. Proceedings., IEEE International Conference on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-6565-3
DOI :
10.1109/ICCD.1994.331882