Article

Free access

Multi-terminal net routing for partial crossbar-based multi-FPGA systems

Authors:

Abdel Ejnioui,

N. RanganathanAuthors Info & Claims

FPGA '99: Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays

Pages 176 - 185

https://doi.org/10.1145/296399.296454

Published: 01 February 1999 Publication History

PDF eReader

References

[1]

XOSL: EXPRESS-MP optimization subroutine library. Ed. 1998, Leamington Spa, U.K: Dash Associates Ltd.

Google Scholar

[2]

Anbil, R., Tanga, R., and Johnson, E.L., A global optimization approach to crew scheduling, 1991, Georgia Institute of Technology: Atlanta.

Google Scholar

[3]

Arnold, J.M., Buell, D.A., and Davis, E.G. Splash 2. In Symp. on Parallel Algorithms and Architectures, (1992), 316-322.

Digital Library

Google Scholar

[4]

Bamhart, C., et ak, Branch-and-price: column generation for solving huge integer programs, in Mathematical Programming: State of the Art, Birge, J. R., and Murty, K. G., Editors. I994, IntemationaI Symposim on Mathematical Programming.

Google Scholar

[5]

Butts, M., Batcheller, J., and Varghese, J. An efficient logic emulation system. In Int. Conf. Computer Design, (Oct. 1992), 138-141.

Digital Library

Google Scholar

[6]

Casselman, S. Virtual computing and the virtual computer. In Proc. Workshop on FPGAs for Custom Computing Machines,(1993), 43-48.

Google Scholar

[7]

Chan, P.K., Schlag, M., and Martin, M. BORG: A reconfigurable prototyping board using field-programmable gate arrays. In First Int. Workshop Field-Programmable Gate Arrays, (Feb. 1992), 47-51.

Google Scholar

[8]

Chan, P.K. and Schlag, M.D.F. Architectural tradeoffs in field programmable device based computing systems, in Workshop on FPGA's Custom Computing Machines,(Apr. 1993), 152-156.

Crossref

Google Scholar

[9]

Coffman, E.G., Garey, M.R., and Johnson, D.S., Approximation algorithms for bin packing.' A survey, in Approximation algorithms for NP-hard problems, Hochbaum, D. S.,Editor. 1997, PWS Publishing Comapny: Boston, MA. p. 46-93.

Digital Library

Google Scholar

[10]

Desrochers, M., Desrosiers, J., and Solomon, M., A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40 (1992), 342- 354.

Digital Library

Google Scholar

[11]

Desrochers, M. and Soumis, F., A column generation approach to the urban transit crew scheduling problem Transporations Science 23 (1989), 1-13.

Google Scholar

[12]

Drayer, T.H., et al. MORPH: A modular and reprogrammable real-time processing hardware. In Syrup. on FPGAs for Custom Computing Machines,(I 995), 11- 19.

Digital Library

Google Scholar

[13]

Farley, A.A., A note on bounding a class of linear programming problems, including cutting stock problems. Operations Research 38 (1990), 922-923.

Digital Library

Google Scholar

[14]

Gilmore, P.C. and Gomory, R.E., A linear programming approach to the cutting stock problem Operations Research 9 (1961), 849-859.

Google Scholar

[15]

Gilmore, P.C. and Gomory, R.E., A linear programming approach to the cutting stock problem: Part II. Operations Research 11 (1963), 863-888.

Digital Library

Google Scholar

[16]

Gokhale, M., et al., Building and using a highly parallel programmable logic array. Computer 24, (Jan. 1991), 81- 89.

Digital Library

Google Scholar

[17]

Lewis, D.M., et al. The Transmogrifier-2: A 1 million gate rapid prototyping system. In Int. Symp. on FPGAs, (1997), 53-61.

Digital Library

Google Scholar

[18]

Lin, S.S., Lin, Y.J., and Hwang, T.T., Net assignment for the FPGA-based logic emulation system in the folded-clos network structure. IEEE Trans. on CAD 16, 3 (Mar. 1997), 316-320.

Digital Library

Google Scholar

[19]

Mak, W.K. and Wong, D.F., Board-level multiterminal net routing for FPGA-based logic emulation. ACM Trans. on DeMgn Automation of Electronic Systems 2, 2 (Apr. 1997), 151-157.

Digital Library

Google Scholar

[20]

Mak, W.K. and Wong, D.F., On optimal board-level routing for FPGA-based logic emulation. IEEE Trans. on CAD 16, 3 (Mar. 1997), 282-289.

Digital Library

Google Scholar

[21]

Mak, W.K. and Wong, D.F. On optimal board-level routing for FPGA-based logic emulation. In DA C, (t995), 552-556.

Crossref

Google Scholar

[22]

Masson, G.M., Gingher, G.C., and Nakamura, S., A sample of circuit switching networks, tEEE Computer (June 1979), 3248.

Google Scholar

[23]

Savelsberg, M., A branch-and-price algorithm for the generalized assignment problem. Operations Research 4, 6 (Dec. 1997), 831-841.

Google Scholar

[24]

Van Den Bout, D.E., et al., AnyBoard: An FPGA-based, reconfigurable system. IEEE Design and Test of Computers (Sept. 1992), 21-30.

Digital Library

Google Scholar

[25]

Vance, P., et al., Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3, 2 (May 1994), 111-130.

Digital Library

Google Scholar

[26]

Vance, P.H., Branch-and-price algorithms for the onedimensional cutting stock problem,. Jul. 1996, Auburn University:. Auburn, Alabama.

Google Scholar

[27]

Vanderbeck, F. and Wolsey, L.A., An exact algorithm for IP column generation. Operations Research Letters 19, 4 (Oct. 1996), 151-159.

Digital Library

Google Scholar

[28]

Varghese, J., Butts, M., and Batcheller, J., An efficient logic emulation system. IEEE Trans. VLSI Syst. 1, 2 (June 1993), 171-174.

Digital Library

Google Scholar

[29]

Vuillemin, J.E., et al., Programmable active memories: Reconfigurable systems come of age. IEEE Trans. VLSI Syst. 4, I (mar. 1996), 56-69.

Digital Library

Google Scholar

[30]

Walters, S., Computer-aided prototyping for ASIC-based systems. IEEE Design & Test (June 1991), 4-10.

Digital Library

Google Scholar

Cited By

View all

Ferreira RCardoso JDamiany AVendramini JTeixeira T(2011)Fast placement and routing by extending coarse-grained reconfigurable arrays with Omega NetworksJournal of Systems Architecture10.1016/j.sysarc.2011.03.00657:8(761-777)Online publication date: Sep-2011
https://doi.org/10.1016/j.sysarc.2011.03.006
Fei He Xiaoyu Song Ming Gu Guowu Yang Hung WJiaguang Sun (2006)Probabilistic optimization for FPGA board level routing problemsIEEE Transactions on Circuits and Systems II: Express Briefs10.1109/TCSII.2005.85956953:4(264-268)Online publication date: Apr-2006
https://doi.org/10.1109/TCSII.2005.859569
Gu MHe FSong XSun J(2005)Multiterminal net assignments by scatter searchMathematical and Computer Modelling: An International Journal10.1016/j.mcm.2004.03.00641:8-9(997-1004)Online publication date: 1-Apr-2005
https://dl.acm.org/doi/10.1016/j.mcm.2004.03.006
Show More Cited By

Recommendations

Multiterminal net routing for partial crossbar-based multi-FPGA systems
Special section on system-level interconnect prediction (SLIP)

Multi-FPGA (field-programmable gate arrays) systems are used as custom computing machines to solve compute-intensive problems and also in the verification and prototyping of large circuits. In this paper, we address the problem of routing multiterminal ...
A hybrid complete-graph partial-crossbar routing architecture for multi-FPGA systems
FPGA '98: Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays

Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing architecture; the manner in which wires, FPGAs and Field-Programmable ...
A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times

Although the textbook Dantzig-Wolfe decomposition reformulation for the capacitated lot-sizing problem, as already proposed by Manne [Manne, A. S. 1958. Programming of economic lot sizes. Management Sci.4(2) 115--135], provides a strong lower bound, it ...

Comments

Information & Contributors

Information

Published In

FPGA '99: Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays

February 1999

257 pages

ISBN:1581130880

DOI:10.1145/296399

Chairmen:
Sinan Kaptanoglu
Actel Corporation
,
Steve Trimberger
Xilinx

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

FPGA99

Sponsor:

SIGDA

FPGA99: ACM/SIGDA Symposium on Field Programmable Gate Arrays

February 21 - 23, 1999

California, Monterey, USA

Acceptance Rates

Overall Acceptance Rate 125 of 627 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
319
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)6

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ferreira RCardoso JDamiany AVendramini JTeixeira T(2011)Fast placement and routing by extending coarse-grained reconfigurable arrays with Omega NetworksJournal of Systems Architecture10.1016/j.sysarc.2011.03.00657:8(761-777)Online publication date: Sep-2011
https://doi.org/10.1016/j.sysarc.2011.03.006
Fei He Xiaoyu Song Ming Gu Guowu Yang Hung WJiaguang Sun (2006)Probabilistic optimization for FPGA board level routing problemsIEEE Transactions on Circuits and Systems II: Express Briefs10.1109/TCSII.2005.85956953:4(264-268)Online publication date: Apr-2006
https://doi.org/10.1109/TCSII.2005.859569
Gu MHe FSong XSun J(2005)Multiterminal net assignments by scatter searchMathematical and Computer Modelling: An International Journal10.1016/j.mcm.2004.03.00641:8-9(997-1004)Online publication date: 1-Apr-2005
https://dl.acm.org/doi/10.1016/j.mcm.2004.03.006
Song XHung WMishchenko AChrzanowska-Jeske MCoppola AKennings AGhose KMadden PDe VKogge P(2002)Board-level multiterminal net assignmentProceedings of the 12th ACM Great Lakes symposium on VLSI10.1145/505306.505335(130-135)Online publication date: 18-Apr-2002
https://dl.acm.org/doi/10.1145/505306.505335
Jain SKumar AKumar S(2002)Hybrid Multi-FPGA board evaluation by limiting multi-hop routingProceedings 13th IEEE International Workshop on Rapid System Prototyping10.1109/IWRSP.2002.1029740(66-73)Online publication date: 2002
https://doi.org/10.1109/IWRSP.2002.1029740

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Multiterminal net routing for partial crossbar-based multi-FPGA systems

A hybrid complete-graph partial-crossbar routing architecture for multi-FPGA systems

A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times