research-article

On the solvability of routing multiple point-to-point paths in manhattan meshes

Authors:

Yannick Vinkesteijn,

Daan van den BergAuthors Info & Claims

GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion

Pages 1685 - 1689

https://doi.org/10.1145/3377929.3398098

Published: 08 July 2020 Publication History

Abstract

The solvability of multiple path routing problems in 3D Manhattan meshes is greatly influenced by the order in which the paths are processed. Unsolvable instances can readily be made solvable by simply changing the sequence of paths to be routed, and the inverse also holds. Our results on square meshes with 100 randomly placed terminals show that the routability of an instance can be accurately guessed a priori from its characteristics only. Furthermore, the attainable routability from random sequence change can also be accurately guessed, and a tight scaling relation suggests these results hold for a broad range of instance sizes. For our particulars, the number of routable paths can increase as much as 73%, just by changing the order of processing.

References

[1]

Hasini Viranga Abeywickrama, Beeshanga Abewardana Jayawickrama, Ying He, and Eryk Dutkiewicz. 2017. Algorithm for energy efficient inter-UAV collision avoidance. In 2017 17th International Symposium on Communications and Information Technologies (ISCIT). IEEE, 1--5.

[2]

Ed Bullmore and Olaf Sporns. 2012. The economy of brain network organization. Nature Reviews Neuroscience 13, 5 (2012), 336.

[3]

Mark A Changizi. 2001. Principles underlying mammalian neocortical scaling. Biological cybernetics 84, 3 (2001), 207--215.

[4]

Peter C Cheeseman, Bob Kanefsky, and William M Taylor. 1991. Where the really hard problems are. In IJCAI, Vol. 91. 331--337.

Digital Library

[5]

Phillip Christie and Dirk Stroobandt. 2000. The interpretation and application of Rent's rule. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 8, 6 (2000), 639--648.

Digital Library

[6]

Rina Dechter and Judea Pearl. 1985. Generalized best-first search strategies and the optimality of A. Journal of the ACM (JACM) 32, 3 (1985), 505--536.

Digital Library

[7]

William A Dees and Patrick G Karger. 1982. Automated rip-up and reroute techniques. In 19th Design Automation Conference. IEEE, 432--439.

Digital Library

[8]

Steve Furber. 2016. Large-scale neuromorphic computing systems. Journal of neural engineering 13, 5 (2016), 051001.

[9]

Patric Hagmann, Leila Cammoun, Xavier Gigandet, Reto Meuli, Christopher J Honey, Van J Wedeen, and Olaf Sporns. 2008. Mapping the structural core of human cerebral cortex. PLoS biology 6, 7 (2008), e159.

[10]

Brian Hayes. 1997. Computing Science: Can't get no satisfaction. American scientist 85, 2 (1997), 108--112.

[11]

Brian Hayes. 2003. Computing Science: On the Threshold. American Scientist 91, 1 (2003), 12--17.

[12]

Reitze Jansen. [n. d.]. Source Code of algorithms used in the experiment. https://github.com/rlhjansen/Point2PointRoutability. ([n. d.]). Accessed: 2020-1-1.

[13]

Sang-Seob Kang, M Sehyun, and SH Hah. 1999. A design expert system for auto-routing of ship pipes. Journal of Ship Production 15, 1 (1999), 1--9.

[14]

János Komlós and Endre Szemerédi. 1983. Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete Mathematics 43, 1 (1983), 55--63.

Digital Library

[15]

PPG Kramer and Jan Van Leeuwen. 1982. Wire routing in NP-complete. Vol. 82. Unknown Publisher.

[16]

Tracy Larrabee and Yumi Tsuji. 1992. Evidence for a satisfiability threshold for random 3CNF formulas. Citeseer.

[17]

Vincenzo Lomonaco, Angelo Trotta, Marta Ziosi, Juan de Dios Yáñez Ávila, and Natalia Díaz-Rodríguez. 2018. Intelligent drone swarm for search and rescue operations at sea. arXiv preprint arXiv:1811.05291 (2018).

[18]

Amin Majd, Elena Troubitsyna, and Masoud Daneshtalab. 2017. Safety-aware control of swarms of drones. In International Conference on Computer Safety, Reliability, and Security. Springer, 249--260.

[19]

Konstantin Moiseev, Avinoam Kolodny, and Shmuel Wimer. 2015. Multi-Net Optimization of VLSI Interconnect. Springer.

[20]

Konstantin Moiseev, Avinoam Kolodny, and Shmuel Wimer. 2015. Multi-Net Optimization of VLSI Interconnect. Springer. 14 pages.

[21]

Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, and Lidror Troyansky. 1999. 2+ p-SAT: Relation of typical-case complexity to the nature of the phase transition. Random Structures & Algorithms 15, 3-4 (1999), 414--435.

[22]

Jin-Hyung Park and Richard L Storch. 2002. Pipe-routing algorithm development: case study of a ship engine room design. Expert Systems with Applications 23, 3 (2002), 299--309.

[23]

Timothy Roden and Ian Parberry. 2004. From artistry to automation: A structured methodology for procedural content creation. In International Conference on Entertainment Computing. Springer, 151--156.

[24]

Frank Rubin. 1974. An iterative technique for printed wire routing. In Annual ACM IEEE Design Automation Conference: Proceedings of the 11th workshop on Design automation, Vol. 1974. 308--313.

[25]

Sara Bulfon. 2019. Piping image from STI Engineering. (November 2019). https://www.sti-engineering.it/en/competenza/piping/, Last accessed on 2019-11-11.

[26]

Majid Sarrafzadeh, Kuo-Feng Liao, and Chak-Kuen Wong. 1994. Single-layer global routing. IEEE transactions on computer-aided design of integrated circuits and systems 13, 1 (1994), 38--47.

Digital Library

[27]

Sheryl Staub-French and Atul Khanzode. 2007. 3D and 4D modeling for design and construction coordination: issues and lessons learned. Journal of Information Technology in Construction (ITcon) 12, 26 (2007), 381--407.

[28]

Daan van den Berg, Pulin Gong, Michael Breakspear, and Cees van Leeuwen. 2012. Fragmentation: loss of global coherence or breakdown of modularity in functional brain architecture? Frontiers in systems neuroscience 6 (2012), 20.

[29]

Martijn P Van den Heuvel, Edward T Bullmore, and Olaf Sporns. 2016. Comparative connectomics. Trends in cognitive sciences 20, 5 (2016), 345--361.

[30]

Roland Van Der Linden, Ricardo Lopes, and Rafael Bidarra. 2013. Procedural generation of dungeons. IEEE Transactions on Computational Intelligence and AI in Games 6, 1 (2013), 78--89.

[31]

Gijs van Horn, Richard Olij, Joeri Sleegers, and Daan van den Berg. 2018. A Predictive Data Analytic for the Hardness of Hamiltonian Cycle Problem Instances. DATA ANALYTICS 2018 (2018), 101.

[32]

Wouter Van Toll, Atlas F Cook, and Roland Geraerts. 2011. Navigation meshes for realistic multi-layered environments. In 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE, 3526--3532.

[33]

R Glenn Wood and Rob A Rutenbar. 1998. FPGA routing and routability estimation via Boolean satisfiability. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 6, 2 (1998), 222--231.

Digital Library

Cited By

Van Eck OVan Den Berg D(2023)Quantifying Instance Hardness of Protein Folding within the HP-model2023 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)10.1109/CIBCB56990.2023.10264888(1-7)Online publication date: 29-Aug-2023
https://doi.org/10.1109/CIBCB56990.2023.10264888
Blokland Mvan der Mei RPruyn JBerkhout J(2023)Literature Survey on Automatic Pipe RoutingOperations Research Forum10.1007/s43069-023-00208-54:2Online publication date: 14-Apr-2023
https://doi.org/10.1007/s43069-023-00208-5
Braam Fvan den Berg D(2022)Which rectangle sets have perfect packings?Operations Research Perspectives10.1016/j.orp.2021.1002119(100211)Online publication date: 2022
https://doi.org/10.1016/j.orp.2021.100211

Index Terms

On the solvability of routing multiple point-to-point paths in manhattan meshes
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Discrete space search
2. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial optimization
      2. Permutations and combinations

Recommendations

Non-Manhattan maze routing
SBCCI '04: Proceedings of the 17th symposium on Integrated circuits and system design

The availability of multiple metal layers in modern IC processes raises the possibility of using non-Manhattan routing on some of the layers in order to reduce the average interconnect length, and thus improve performance and routability. In this paper, ...
Non-Manhattan Routing Using a Manhattan Router
VLSID '05: Proceedings of the 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design

In Deep Sub-micron (DSM) designs, wire delays comprise a significant fraction of the total delay of a design. Therefore, techniques such as non-Manhattan routing, which reduce the total wire length of a design, are highly relevant for today's designs. ...
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
GLSVLSI '00: Proceedings of the 10th Great Lakes symposium on VLSI

Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the interconnect problem by reducing wire lengths directly. We present a non-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion

July 2020

1982 pages

ISBN:9781450371278

DOI:10.1145/3377929

General Chair:
Carlos Artemio Coello Coello
CINVESTAV-IPN

Copyright © 2020 ACM.

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]

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 July 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '20

Sponsor:

SIGEVO

GECCO '20: Genetic and Evolutionary Computation Conference

July 8 - 12, 2020

Cancún, Mexico

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
120
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Van Eck OVan Den Berg D(2023)Quantifying Instance Hardness of Protein Folding within the HP-model2023 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)10.1109/CIBCB56990.2023.10264888(1-7)Online publication date: 29-Aug-2023
https://doi.org/10.1109/CIBCB56990.2023.10264888
Blokland Mvan der Mei RPruyn JBerkhout J(2023)Literature Survey on Automatic Pipe RoutingOperations Research Forum10.1007/s43069-023-00208-54:2Online publication date: 14-Apr-2023
https://doi.org/10.1007/s43069-023-00208-5
Braam Fvan den Berg D(2022)Which rectangle sets have perfect packings?Operations Research Perspectives10.1016/j.orp.2021.1002119(100211)Online publication date: 2022
https://doi.org/10.1016/j.orp.2021.100211

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten