Article

Free access

An architecture-independent approach to FPGA routing based on multi-weighted graphs

Authors:

Michael J. Alexander,

James P. Cohoon,

Joseph L. Ganley,

Gabriel RobinsAuthors Info & Claims

EURO-DAC '94: Proceedings of the conference on European design automation

Pages 259 - 264

Published: 23 September 1994 Publication History

PDF eReader

References

[1]

M. J. ALEXANDER AND G. ROBINS, An Architecture- Independent Unijied Approach to FPGA Routing, Tech. Rep. CS-93-51, Department of Computer Science, University of Virginia, October 1993.

Digital Library

Google Scholar

[2]

M. J. ALEXANDER AND G. ROBINS, High-Performance Routing for Field-Programmable Gale Arrays, in Proc. IECEE Intl. ASIC Conf., Rochester, NY, September 1994.

Google Scholar

[3]

M. J. ALEXANDER AND G. ROBINS, A New Approach to FPGA Routing Based on Multi- Weighfed Graphs, in Proc. ACM/SIGDA International Workshop on Field- PTOgr anunable Gate Arrays, Berkeley, CA, February 1994.

Google Scholar

[4]

T. BARRERA, J. GRIFFITH, S. A. MCKEE, G. ROBINS, AND T. ZHANG, Toward a Steiner Engine: Enhanced Serial and Parallel Implementalions of the Iterated I-Steiner Algorithm, in Proc. Great Lakes Symp. VLSI, Kalamazoo, MI, March 1993, pp. 90-94.

Google Scholar

[5]

T. BARRERA, J. GRIFFITH, G. ROBINS, AND T. ZHANG, Narrowing Ihe Gap: Near-Optimal Steiner Trees in Polynomial Time, in Proc. IEEE Intl. ASIC Conf., Rochester, NY, September 1993, pp. 87-90.

Google Scholar

[6]

N. B. BHAT AND D. D. HILL, Routable Technology Mapping for LCIT FPGAs, in Proc. IEEE Intl. Conf. Computer-Aided Design, 1992, pp. 95-98.

Digital Library

Google Scholar

[7]

S. BROWN, J. ROSE, AND Z. G. VRANESIC, A Detailed Router for Field-Programmable Gate Arrays, IEEE Trans. Computer-Aided Design, 11 (1992), pp. 620-628.

Digital Library

Google Scholar

[8]

S. D. BROWN, R. J. FRANCIS, J. ROSE, AND Z. G. VRANESIC, Field-Programmable Gale Arrays, Kluwer Academic Publishers, Boston, MA, 1992.

Digital Library

Google Scholar

[9]

P. K. CHAN, M. D. F. SCHLAG, AND J. Y. ZIEN, On Routability Prediction for Field-Programmable Gafe Ar- Taya, in Proc. ACM/IEEE Design Automation Conf., 1993, pp. 326-330.

Digital Library

Google Scholar

[10]

K. C. CHEN, J. CONG, Y. DING, A. B. KAHNG, AND P. TRAJMAR, DAG-Map: Graph-Based FPGA Technology Mapping for Delay Optimizalion, IEEE Design & Test of Computers, 9 (1992), pp. 7-20.

Digital Library

Google Scholar

[11]

J. P. COHOON AND D. S. RICHARDS, Optimal TWO- Terminal a -/3 Wire Routing, Integration: the VLSI JOUP nal, 6 (1988), pp. 35-57.

Digital Library

Google Scholar

[12]

W. C. COLLIER AND R. J. WEILAND, Smart Cars, Smart Highways, IEEE Spectrum, 31 (1994), pp. 27-33.

Digital Library

Google Scholar

[13]

J. L. GANLEY AND J. P. COHOON, Routing a Multi- Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles, in Proc. IEEE Intl. Symp. Circuits and Systems, London, England, May 1994, pp. l-.113- 1.116.

Crossref

Google Scholar

[14]

J. L. GANLEY, M. J. GOLIN, AND J. S. SALOWE, Minimum Spanning Trees for Multiply-Weighted Graphs unpublished manuscript, 1994.

Google Scholar

[15]

T. GAO, K. C. CHEN, J. CONG, Y. DING, AND C. L. LIU, Placement and Placement Driven Technology Mapping fog FPGA Synthesis, in Proc. IEEE I&l. ASIC Conf., Rochester, NY, September 1993, pp. 87-91.

Google Scholar

[16]

M. GAREY AND D. S. JOHNSON, The Rectilinear Steiner Problem is NP-Complete, SIAM J. Applied Math., 32 (1977), pp. 826-834.

Crossref

Google Scholar

[17]

M. HANAN, On Steiner's Problem With Rectilinear Distance, SIAM J. Applied Math., 14 (1966), pp. 255-265.

Crossref

Google Scholar

[18]

T. C. Hu AND T. SHING, The 0-p Routing, in VLSI Circuit Layout: Theory and Design, New York, 1985, IEEE I?ress, pp. 139-143.

Google Scholar

[19]

F. K. HWANG, D. S. RICHARDS, AND P. WINTER, The Steiner Tree Problem, North-Holland, 1992.

Google Scholar

[20]

A. B. KAHNG AND G. ROBINS, A New Class of her-alive Steiner Tree Heuristics With Good Performance, IEEE Trans. Computer-Aided Design, 11 (1992), pp. 893-902.

Digital Library

Google Scholar

[21]

K. KARPLUS, .Ymap: a Technology Mapper for Tablelookup Field-Programmable Gate Arrays, in Proc. ACM/IEEE Design Automation Conf., 1991, pp. 240-243.

Digital Library

Google Scholar

[22]

L. Kou, G. MARKOWSKY, AND L. BERMAN, A Fast Algorithm for Steiner Trees, Acta Informatica, 15 (1981), pp. 141-145.

Digital Library

Google Scholar

[23]

G. G. LEMIEUX AND S. D. BROWN, A Detailed .Rouling Algorithm for Alloealing Wire Segments in Field- Programmable Gate Arrays, in Proc. ACM/SIGDA Physical Design Workshop, Lake Arrowhead, CA, April 1993.

Google Scholar

[24]

F. D. LEWIS AND W. C. PONG, A Negative Reinforcemenl Melhod of PGA Routing, in Proc. ACM/IEEE Design Automation Cord., 1993, pp. 601-605.

Digital Library

Google Scholar

[25]

J. ROSE, Parallel Global Routing GOT Standard Cells, IEEE Trans. Computer-Aided Design, 9 (1990), pp. 1085-1095.

Digital Library

Google Scholar

[26]

K. ROY, B. GUAN, AND C. SECHEN, FPGA MChi Partitioning and Placement, in Proc. ACM/SIGDA Physical Design Workshop, Lake Arrowhead, CA, April .1993, pp. 211-212.

Google Scholar

[27]

M. SCHLAG, J. KONG, AND P. K. CHAN, Routabilily- Driven Technology Mapping for LookUp Table-Based FP- GAS, in Proc. IEEE Kntl. Conf. Computer-Aided Design, 1992, pp. 86-90.

Digital Library

Google Scholar

[28]

TRIHBERGER AND M. R. CHENE, Placement-Based Partitioning for Lookup-Table-Based FPGAs, in Proc. IEEE Ml. Conf. Computer-Aided Design, 1992, pp. 91-94.

Digital Library

Google Scholar

[29]

S. M. TRIMBERGER, Field-Programmable Gale flrray Technology, S. M. Trimberger, edilo,r, Kluwer Academic Publishers, Boston, MA, 1994.

Digital Library

Google Scholar

[30]

B. TSENG, J. ROSE, AND S. BROWN, Improving F.PGA Routing Archileclures Using Architecture and CAL) Interacfions, in Proc. IEEE Intl. Conf. Computer Design, 1992, pp. 99-104.

Digital Library

Google Scholar

[31]

Y. F. WV, P. WIDMAYER, AND C. K. WONG, A Faster Approzimalion Algorithm for Ihe Steiner Problem in Graphs, 4cta Informatica, 23 (1986), pp. 223-229.

Digital Library

Google Scholar

[32]

XILINX, The Programmable Gate Array Data Book, Xilnx, Inc., San Jose, California, 1993.

Google Scholar

Cited By

View all

Hauck SDeHon A(2007)Reconfigurable ComputingundefinedOnline publication date: 2-Nov-2007
Singh AParthasarathy GMarek-Sadowska MErnst R(2001)Interconnect resource-aware placement for hierarchical FPGAsProceedings of the 2001 IEEE/ACM international conference on Computer-aided design10.5555/603095.603122(132-136)Online publication date: 4-Nov-2001
Parthasarathy GMarek-Sadowska MMukherjee ASingh AChristie PDavis JSylvester D(2001)Interconnect complexity-aware FPGA placement using Rent's ruleProceedings of the 2001 international workshop on System-level interconnect prediction10.1145/368640.368806(115-121)Online publication date: 1-Mar-2001
Show More Cited By

Index Terms

An architecture-independent approach to FPGA routing based on multi-weighted graphs

Recommendations

Heavy cycles in k-connected weighted graphs with large weighted degree sums

A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edges. The weighted degree of a vertex is the sum of the weights of the edges ...
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs

The maximum weight independent set (WMIS) problem is a well-known NP-hard problem. It is a generalization of the maximum cardinality independent set problem where all the vertices have identical weights. There is an O ( n 2 ) time algorithm to compute a ...
An Architecture-Independent Unified Approach to FPGA Routing

Comments

Information & Contributors

Information

Published In

EURO-DAC '94: Proceedings of the conference on European design automation

September 1994

697 pages

ISBN:0897916859

Chairman:
Jean Mermet
ECSI Office, Gie`res, France

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 23 September 1994

Check for updates

Qualifiers

Article

Conference

EuroDAC94

Sponsor:

SIGDA

EuroDAC94: European Design Automation Conference

September 19 - 23, 1994

Grenoble, France

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
318
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)7

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hauck SDeHon A(2007)Reconfigurable ComputingundefinedOnline publication date: 2-Nov-2007
Singh AParthasarathy GMarek-Sadowska MErnst R(2001)Interconnect resource-aware placement for hierarchical FPGAsProceedings of the 2001 IEEE/ACM international conference on Computer-aided design10.5555/603095.603122(132-136)Online publication date: 4-Nov-2001
Parthasarathy GMarek-Sadowska MMukherjee ASingh AChristie PDavis JSylvester D(2001)Interconnect complexity-aware FPGA placement using Rent's ruleProceedings of the 2001 international workshop on System-level interconnect prediction10.1145/368640.368806(115-121)Online publication date: 1-Mar-2001
Wood RRutenbar REbeling C(1997)FPGA routing and routability estimation via Boolean satisfiabilityProceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays10.1145/258305.258322(119-125)Online publication date: 9-Feb-1997
Alexander MRobins GPreas B(1995)New performance-driven FPGA routing algorithmsProceedings of the 32nd annual ACM/IEEE Design Automation Conference10.1145/217474.217589(562-567)Online publication date: 1-Jan-1995

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

Heavy cycles in k-connected weighted graphs with large weighted degree sums

A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs

An Architecture-Independent Unified Approach to FPGA Routing

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Heavy cycles in k-connected weighted graphs with large weighted degree sums

A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs

An Architecture-Independent Unified Approach to FPGA Routing

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations