Incremental reconfiguration of multi-FPGA systems

ABSTRACT

In reconfigurable computing, circuits implemented on multi-FPGA systems have to be incrementally modified. Since reconfiguring an FPGA is time-consuming, the time for reconfiguration depends on the number of FPGAs to be reconfigured. Our objective is to reduce the number of such FPGAs. In this paper, we consider the specific problem of incrementally reconfiguring a multi-FPGA system that utilizes the direct interconnection architecture, where routing connections between FPGAs are to neighbors that are near. This problem can be divided into a net addition problem and a net deletion problem. We show that the net addition problem is a generalization of the NP-complete Steiner tree problem. Our algorithm for this problem is based on an adaptation of the Klein-Ravi approximation algorithm for the node-weighted Steiner tree problem. As for the net deletion problem, we prove that it is NP-complete but the problem is solvable in polynomial time for tree topologies. Based on the algorithm for trees, we design an effective heuristic algorithm for the general net deletion problem. Finally, we present an algorithm for solving the incremental reconfiguration problem which handles both placement of new gates and inter-FPGA routing.

REFERENCES

• 1: Axis Corporation. "Xcite-2000 datasheet". http://www.axiscorp.com/products/Xcite2000.html, 1999.
• 2: J. Babb, R. Tessier, M. Dahl, S. Hanono, D. Hoki, and A. Agarwal. "Logic Emulation with Virtual Wires". IEEE Transactions on Computer Aided Design, 16(6):609-626, June 1997.
• 3: N. W. Bergmann and J. C. Mudge. "Comparing the Performance of FPGA-Based Custom Computers with General- Purpose Computers for DSP Applications".InProceedings FPGA Symposium, pages 164-171, 1994.
• 4: M. Chrobak and T. H. Payne. "A Linear-time Algorithm for Drawing a Planer Graph on a Grid".InTR UCR-CS-90-2, Department of Math and Computer Sciences., University of California at Riverside, 1990.
• 5: M. R. Garey and D. S. Johnson. "Computers and Intractability". W. H. Feeman & Company, 1979.
• 6: Sudipto Guha , Samir Khuller, Improved methods for approximating node weighted Steiner trees and connected dominating sets, Information and Computation, v.150 n.1, p.57-74, April 10, 1999 [doi>10.1006/inco.1998.2754]
• 7: S. Hauck, G. Borriello, and C. Ebeling. "Springbok: A Rapid- Prototyping System for Board-Level Designs".InProceedings FPGA Symposium, pages 170-177, October 1994.
• 8: Ikos Systems, Inc. "VirtuaLogic Emulation System Manual". Feb 1997.
• 9: G. Kant. "Drawing Planar Graphs Using the Canonical Ordering". InProceedings Foundation of Computer Science, 1992.
• 10: T. Kean and I. Buchanan. "The Use of FPGAs in a Novel Computing Subsystem".InProceedings FPGA Symposium, pages 60-66, 1992.
• 11: M. A. S. Khalid and J. Rose. "The Effect of Fixed I/O Positioning on The Routability and Speed of FPGAs".InCanadian Workshop on Field Programmable Devices, pages 94- 102, 1995.
• 12: M. A. S. Khalid and J. Rose. "Experimental Evaluation of Mesh and Partial Crossbar Routing Architecture for Multi- FPGA Systems".InInternational Workshop on Logic and Architecture Synthesis, pages 119-127, December 1997.
• 13: Mohammed A. S. Khalid , Jonathan Rose, A hybrid complete-graph partial-crossbar routing architecture for multi-FPGA systems, Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays, p.45-54, February 22-25, 1998, Monterey, California, United States [doi>10.1145/275107.275119]
• 14: P. Klein and R. Ravi. "A Nearly Best-possible Approximation Algorithm for Node-weighted Steiner Trees".InProceedings Integer Programming and Combinatorial Optimization, pages 323-331, 1993.
• 15: D. Matthew, B. Jonathan, R. Tessier, S. Hanono, D. Hoki, and A. Agarwal. "Emulation of the sparcle microprocessor with the MIT virtual wires emulation system".InProceedings FPGA Symposium, pages 14-22, 1994.
• 16: Quickturn. "Mercury Technology Backgrounder". http://www.quickturn.com/products/mercury backgrounder.htm, 2000.
• 17: Paul Shaw , George Milne, A Highly Parallel FPL-Based Machine and Its Formal Verification, Selected papers from the Second International Workshop on Field-Programmable Logic and Applications, Field-Programmable Gate Arrays: Architectures and Tools for Rapid Prototyping, p.162-173, August 31-September 02, 1992
• 18: Roberto Tamassia , Ioannis G. Tollis , Jeffrey Scott Vitter, Lower bounds for planar orthogonal drawings of graphs, Information Processing Letters, v.39 n.1, p.35-40, July 12, 1991 [doi>10.1016/0020-0190(91)90059-Q]
• 19: Russell Tessier, Incremental Compilation for Logic Emulation, Proceedings of the Tenth IEEE International Workshop on Rapid System Prototyping, p.236, June 16-18, 1999
• 20: K. Yamada, H. Nakada, A. Tsutsui, and N. Ohta. "High-Speed Emulation of Communication Circuits on a Multiple-FPGA system".InProceedings FPGA Symposium, 1994.
• 21: J. Varghese, M. Butts, and J. Batcheller. "An Efficient Logic Emulation System".InIEEE Transactions on VLSI Systems, 1(2), Jun. 1993.
• 22: A. Zelikovsky. "An 11/6-approximation algorithm for the network Steiner problem". Algorithmica, 9:463-470, 1993.