Article

Free access

Node-disjoint paths on the mesh and a new trade-off in VLSI layout

Authors:

Alok Aggarwal,

Jon Kleinberg,

David P. WilliamsonAuthors Info & Claims

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

Pages 585 - 594

https://doi.org/10.1145/237814.238007

Published: 01 July 1996 Publication History

PDF eReader

References

[1]

A. Aggarwal, M. Klawe, D. Lichtenstein, N. Linial, A. Wigderson, "Multi-layer grid embeddings," Proc. 26th IEEE FOCS, 1985.

Google Scholar

[2]

A. Aggarwal, M. Klawe, D. Lichtenstein, N. Linial, A. Wigderson, "A lower bound on the area of permutation layouts," Algorithmica, 6(1991), pp. 241-255.

Digital Library

Google Scholar

[3]

A. Aggarwal, M. Klawe, P. Shot, "Multi-layer grid embeddings for VLSI," Algorithmica, 6(1991), pp. 129-151.

Digital Library

Google Scholar

[4]

R. Cole, A. Siegel, "River routing every which way but loose," Proc. 25th IEEE FOCS, 1984.

Google Scholar

[5]

M. Cutler, Y. Shiloach, "Permutation layout," Networks, 8(1978), pp. 253-278.

Crossref

Google Scholar

[6]

P. ErdSs, G. Szekeres, "A combinatorial problem in geometry," Compositio Math., 2(1935), pp. 463-470.

Google Scholar

[7]

M. Klawe, F.T. Leighton, "A tight lower bound on the area of planar permutation layouts," SIAM J. Discrete Math., 5(1992), pp. 558-563.

Digital Library

Google Scholar

[8]

J. Kleinberg, l~. Tardos, "Disjoint paths in densely embedded graphs," Proc. 36th IEEE FOC$, 1995.

Digital Library

Google Scholar

[9]

M.E. Kramer, J. van Leeuwen, "The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits," Advances in Computing Research 2: VL$I Theory, F.P. Preparata, Ed., London: JAI Press, 1984. pp. 129-146.

Google Scholar

[10]

F.T. Leighton, Layouts for the Shuffle-Exchange Graph and Lower Bound Techniques for VL$i, Ph.D. Thesis, MIT Math Dept., 1981.

Google Scholar

[11]

C. Leiserson, F.M. Maley, "Algorithms for routing and testing routability of planar VLSI layouts," Proc. 17th A CM $TOC, 1985.

Digital Library

Google Scholar

[12]

W.R. Pulleyblank, "Two Steiner tree packing problems," invited talk at ACM Symposium on Theory of Computing, 1995.

Digital Library

Google Scholar

[13]

P. Raghavan, E. Upfal, "Efficient all-optical routing,'' Proc. ~6th A CM $TOC, 1994.

Digital Library

Google Scholar

[14]

R~ Rivest, "The placement and interconnect system,'' Proc. 19th Design and Automation Conference, 1982.

Digital Library

Google Scholar

[15]

N. Robertson, P.D. Seymour, "Graph Minors VII. Disjoint paths on a surface," J. Combinatorial Theory Set. B, 45(1988), pp. 212-254.

Digital Library

Google Scholar

[16]

A. Schrijver, "Disjoint homotopic paths and trees in a planar graph~" Discrete and Computalional Geometry, 6(1991), pp. 527-574.

Digital Library

Google Scholar

Cited By

View all

Kaneko KBossard A(2017)A Set-to-Set Disjoint Paths Routing Algorithm in ToriInternational Journal of Networking and Computing10.15803/ijnc.7.2_1737:2(173-186)Online publication date: 2017
https://doi.org/10.15803/ijnc.7.2_173
Bossard AKaneko K(2014)The Container Problem in a Torus-connected Cycles NetworkProcedia Computer Science10.1016/j.procs.2014.05.20329(2182-2191)Online publication date: 2014
https://doi.org/10.1016/j.procs.2014.05.203

Index Terms

Node-disjoint paths on the mesh and a new trade-off in VLSI layout
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
      1. Partitioning and floorplanning
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Shortest node-to-node disjoint paths algorithm for symmetric networks
Abstract
Disjoint paths are defined as paths between the source and destination nodes where the intermediate nodes in any two paths are disjoint. They are helpful in fault-tolerance routing and securing message distribution in the network. Several research ... $^{}$
Optimal construction of node-disjoint shortest paths in folded hypercubes

Node-disjoint paths have played an important role in the study of routing, reliability, and fault tolerance of an interconnection network. In this paper, we give a necessary and sufficient condition, which can be verified in O(mn1.5) time, for the ...
Constructing all shortest node-disjoint paths in torus networks

An n -dimensional torus network, also called wrap-around mesh or toroidal network, is a Cartesian product of n cycle networks. In particular, it was named k -ary n -cube when the sizes of the n cycle networks are all equal to k . In this paper, m node-...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

July 1996

661 pages

ISBN:0897917855

DOI:10.1145/237814

Chairman:
Gary L. Miller

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 July 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC96

Sponsor:

SIGACT

STOC96: ACM Symposium on Theory of Computing

May 22 - 24, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

STOC '96 Paper Acceptance Rate 74 of 201 submissions, 37%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
337
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)2

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kaneko KBossard A(2017)A Set-to-Set Disjoint Paths Routing Algorithm in ToriInternational Journal of Networking and Computing10.15803/ijnc.7.2_1737:2(173-186)Online publication date: 2017
https://doi.org/10.15803/ijnc.7.2_173
Bossard AKaneko K(2014)The Container Problem in a Torus-connected Cycles NetworkProcedia Computer Science10.1016/j.procs.2014.05.20329(2182-2191)Online publication date: 2014
https://doi.org/10.1016/j.procs.2014.05.203

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Shortest node-to-node disjoint paths algorithm for symmetric networks

Optimal construction of node-disjoint shortest paths in folded hypercubes

Constructing all shortest node-disjoint paths in torus networks