Stochastic spatial routing for reconfigurable networks

FPGA placement and routing is time consuming, often serving as the major obstacle inhibiting a fast edit-compile-test loop in prototyping and development and the major obstacle preventing late-bound hardware and design mapping for reconfigurable systems. We introduce a stochastic search scheme which can achieve comparable route quality to traditional, software-based routers while being amenable to parallel, spatial implementation. We quantify the quality and performance of this route scheme using the Toronto Place-andRoute Challenge benchmarks. We sketch hardware implementations ranging from a minimal hardware-search assistance scheme which provides two orders of magnitude speedup, to FPGA-based schemes which provide greater speedup, to full hardware schemes which provide over three orders of magnitude routing acceleration. For coarse-grained devices with wide-word datapaths, the area overhead for integrating this hardware support into the network can be below 30%; for conventional FPGAs, a collection of hundreds of FPGAs can be configured to route one FPGA rapidly. With parallel path searches, the time required for the spatial solution scales sublinearly in network size for the typical, limited-bisection networks used for practical reconfigurable systems. � 2006 Elsevier B.V. All rights reserved.

[1]  Ieee Circuits,et al.  IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2018, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[2]  Bruce M. Maggs,et al.  On-line algorithms for path selection in a nonblocking network , 1990, STOC '90.

[3]  Vaughn Betz,et al.  A fast routability-driven router for FPGAs , 1998, FPGA '98.

[4]  Marco Platzner,et al.  Instance-Specific Accelerators for Minimum Covering , 2004, The Journal of Supercomputing.

[5]  Sharad Malik,et al.  Using configurable computing to accelerate Boolean satisfiability , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Anant Agarwal,et al.  Virtual wires: overcoming pin limitations in FPGA-based logic emulators , 1993, [1993] Proceedings IEEE Workshop on FPGAs for Custom Computing Machines.

[7]  Stylianos Perissakis,et al.  Stream computations organized for reconfigurable execution , 2006, Microprocess. Microsystems.

[8]  Alexander Iosupovici,et al.  A Class of Array Architectures for Hardware Grid Routers , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  George Varghese,et al.  HSRA: high-speed, hierarchical synchronous reconfigurable array , 1999, FPGA '99.

[10]  André DeHon,et al.  Rent's rule based switching requirements , 2001, SLIP '01.

[11]  Christopher R Carroll.  A Smart Memory Array Processor for Two Layer Path Finding , 1981 .

[12]  André DeHon,et al.  Balancing interconnect and computation in a reconfigurable computing array (or, why you don't really want 100% LUT utilization) , 1999, FPGA '99.

[13]  Anthony J. Yu,et al.  Directional and single-driver wires in FPGA interconnect , 2004, Proceedings. 2004 IEEE International Conference on Field- Programmable Technology (IEEE Cat. No.04EX921).

[14]  John Wawrzynek,et al.  Stochastic, spatial routing for hypergraphs, trees, and meshes , 2003, FPGA '03.

[15]  Joseph Varghese,et al.  An efficient logic emulation system , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[16]  Bruce M. Maggs,et al.  On-Line Algorithms for Path Selection in a Nonblocking Network , 1996, SIAM J. Comput..

[17]  Bradley C. Kuszmaul,et al.  Cyclic Segmented Parallel Prefix , 1998 .

[18]  S. Perissakis,et al.  Embedded DRAM for a reconfigurable array , 1999, 1999 Symposium on VLSI Circuits. Digest of Papers (IEEE Cat. No.99CH36326).

[19]  Martine D. F. Schlag,et al.  Acceleration of an FPGA router , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[20]  John Wawrzynek,et al.  Hardware-assisted fast routing , 2002, Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.

[21]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[22]  Stephan W. Gehring,et al.  Fast integrated tools for circuit design with FPGAs , 1998, FPGA '98.

[23]  Russell Tessier.  Negotiated A* Routing for FPGAs ∗ , 1998 .

[24]  Hitoshi Kitazawa,et al.  A Parallel Adaptable Routing Algorithm and its Implementation on a Two-Dimensional Array Processor , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[25]  Roy L. Russo,et al.  On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.

[26]  Carl Ebeling,et al.  PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[27]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[28]  Martine D. F. Schlag,et al.  New parallelization and convergence results for NC: a negotiation-based FPGA router , 2000, FPGA '00.

[29]  Jonathan Rose,et al.  Routing for FPGAs , 1992 .

[30]  Steven M. Christey.  The Infinite Monkey Protocol Suite (IMPS) , 2000, RFC.

[31]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[32]  Hasan Çam,et al.  Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks , 1999, IEEE Trans. Parallel Distributed Syst..

[33]  ScienceDirect.  Microprocessors and microsystems , 1978 .

[34]  André DeHon,et al.  Hardware-assisted simulated annealing with application for fast FPGA placement , 2003, FPGA '03.

[35]  R. Nair,et al.  Wire-routing machines—New tools for VLSI physical design , 1983, Proceedings of the IEEE.

[36]  John Wawrzynek,et al.  Stream Computations Organized for Reconfigurable Execution (SCORE): Introduction and Tutorial , 2000 .

[37]  Edwin Rogers,et al.  An Isma Lee Router Accelerator , 1987, IEEE Design & Test of Computers.

[38]  John Wawrzynek,et al.  Hardware-assisted fast routing for runtime reconfigurable computing , 2004 .

[39]  Vikas Agarwal,et al.  Clock rate versus IPC: the end of the road for conventional microarchitectures , 2000, Proceedings of 27th International Symposium on Computer Architecture (IEEE Cat. No.RS00201).