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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (1.06 MB)

Source

International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays table of contents

Monterey, California, United States

Pages: 176 - 185

Year of Publication: 1999

ISBN:1-58113-088-0

Authors

Abdel Ejnioui	Center for Microelectronics Research, University of South Florida, Tampa, FL
N. Ranganathan	Dept. of Electrical & Computer Engineering, The University of Texas at El Paso, El Paso, Texas

Sponsor

SIGDA: ACM Special Interest Group on Design Automation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 16, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/296399.296454 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	XOSL: EXPRESS-MP optimization subroutine library. Ed. 1998, Leamington Spa, U.K: Dash Associates Ltd.
	2	Anbil, R., Tanga, R., and Johnson, E.L., A global optimization approach to crew scheduling, 1991, Georgia Institute of Technology: Atlanta.
	3	Jeffrey M. Arnold , Duncan A. Buell , Elaine G. Davis, Splash 2, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.316-322, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.141896]
	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.
	5	Michael Butts , Jon Batcheller , Joseph Varghese, An Efficient Logic Emulation System, Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors, p.138-141, October 11-14, 1992
	6	Casselman, S. Virtual computing and the virtual computer. In Proc. Workshop on FPGAs for Custom Computing Machines,(1993), 43-48.
	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.
	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.
	9	E. G. Coffman, Jr. , M. R. Garey , D. S. Johnson, Approximation algorithms for bin packing: a survey, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, 1996
	10	Martin Desrochers , Jacques Desrosiers , Marius Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, v.40 n.2, p.342-354, March–April 1992 [doi>10.1287/opre.40.2.342]
	11	Desrochers, M. and Soumis, F., A column generation approach to the urban transit crew scheduling problem Transporations Science 23 (1989), 1-13.
	12	T. H. Drayer , J. G. Tront , W. E. King, IV , R. W. Conners, MORRPH: a modular and reprogrammable real-time processing hardware, Proceedings of the IEEE Symposium on FPGA's for Custom Computing Machines, p.11, April 19-21, 1995
	13	A. A. Farley, A note on bounding a class of linear programming problems, including cutting stock problems, Operations Research, v.38 n.5, p.922-923, Sep./Oct. 1990 [doi>10.1287/opre.38.5.922]
	14	Gilmore, P.C. and Gomory, R.E., A linear programming approach to the cutting stock problem Operations Research 9 (1961), 849-859.
	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.
	16	Maya Gokhale , William Holmes , Andrew Kopser , Sara Lucas , Ronald Minnich , Douglas Sweely , Daniel Lopresti, Building and Using a Highly Parallel Programmable Logic Array, Computer, v.24 n.1, p.81-89, January 1991 [doi>10.1109/2.67197]
	17	David M. Lewis , David R. Galloway , Marcus van Ierssel , Jonathan Rose , Paul Chow, The Transmogrifier-2: a 1 million gate rapid prototyping system, Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays, p.53-61, February 09-11, 1997, Monterey, California, United States [doi>10.1145/258305.258312]
	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.
	19	Wai-Kei Mak , D. F. Wong, Board-level multiterminal net routing for FPGA-based logic emulation, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.2 n.2, p.151-167, April 1997 [doi>10.1145/253052.253136]
	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.
	21	Wai-Kei Mak , D. F. Wong, On optimal board-level routing for FPGA-based logic emulation, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.552-556, June 12-16, 1995, San Francisco, California, United States [doi>10.1145/217474.217586]
	22	Masson, G.M., Gingher, G.C., and Nakamura, S., A sample of circuit switching networks, tEEE Computer (June 1979), 3248.
	23	Savelsberg, M., A branch-and-price algorithm for the generalized assignment problem. Operations Research 4, 6 (Dec. 1997), 831-841.
	24	David E. Van den Bout , Joseph N. Morris , Douglas Thomae , Scott Labrozzi , Scot Wingo , Peter Hallman, AnyBoard: An FPGA-Based, Reconfigurable System, IEEE Design & Test, v.9 n.3, p.21-30, July 1992 [doi>10.1109/54.156155]
	25	Pamela H. Vance , Cynthia Barnhart , Ellis L. Johnson , George L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound, Computational Optimization and Applications, v.3 n.2, p.111-130, May 1994 [doi>10.1007/BF01300970]
	26	Vance, P.H., Branch-and-price algorithms for the onedimensional cutting stock problem,. Jul. 1996, Auburn University:. Auburn, Alabama.
	27	Vanderbeck, F. and Wolsey, L.A., An exact algorithm for IP column generation. Operations Research Letters 19, 4 (Oct. 1996), 151-159.
	28	Varghese, J., Butts, M., and Batcheller, J., An efficient logic emulation system. IEEE Trans. VLSI Syst. 1, 2 (June 1993), 171-174.
	29	Jean E. Vuillemin , Patrice Bertin , Didier Roncin , Mark Shand , Hervé H. Touati , Philippe Boucard, Programmable active memories: reconfigurable systems come of age, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.4 n.1, p.56-69, March 1996 [doi>10.1109/92.486081]
	30	Stephen Walters, Computer-Aided Prototyping for ASIC-Based Systems, IEEE Design & Test, v.8 n.2, p.4-10, April 1991 [doi>10.1109/54.82034]

CITED BY 2

	Xiaoyu Song , William N. N. Hung , Alan Mishchenko , Malgorzata Chrzanowska-Jeske , Alan Coppola , Andrew Kennings, Board-level multiterminal net assignment, Proceedings of the 12th ACM Great Lakes symposium on VLSI, April 18-19, 2002, New York, New York, USA
	Katherine Compton , Scott Hauck, Reconfigurable computing: a survey of systems and software, ACM Computing Surveys (CSUR), v.34 n.2, p.171-210, June 2002