Location of Repository

Routing on Switch Matrix Multi-FPGA Systems

By Abdel Ejnioui and N. Ranganathan

Abstract

In this paper, we address the problem of routing nets on multi-FPGA systems interconnected by a switch matrix. Switch matrices were introduced to route signals going from one channel to another inside the FPGA chips. We extend the switch matrix architecture proposed by Zhu et al. [1] to route nets between FPGA chips in a multi-FPGA system. Given a limited number of routing resources in the form of programmable connection points within a twodimensional switch matrix, this problem examines the issue of how to route a given net traffic through the switch matrix structure. First we formulate the problem as a general undirected graph in which each vertex has one single color. Since there can be at most six colors in the entire graph, the problem is defined as a search for at most six independent vertex sets of each color in the graph. We propose an exact solution for this problem that is suitable only for small size switch matrices. For large size switch matrices used in multi-FPGA systems,..

Topics: Index Terms-Switch routing, FPGA architecture, Interconnection structures, Global routing, Field programmable
Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.41.9934
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://vcapp.csee.usf.edu/~ejn... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.