A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction

DOI10.1007/S00500-014-1329-2zbMath1382.68015OpenAlexW1982719471MaRDI QIDQ1708730

Xing Huang, Yuzhen Niu, Guo-Long Chen, Wen-Zhong Guo, Geng-Geng Liu

Publication date: 26 March 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-014-1329-2

zbMATH Keywords

particle swarm optimization (PSO)timing delaynumber of bendsoctilinear Steiner tree (OST)performance-driven routingvery large scale integration (VLSI)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical problems of computer architecture (68M07)

Related Items (1)

Accelerated high-dimensional global optimization: a particle swarm optimizer incorporating homogeneous learning and autophagy mechanisms

Uses Software

• OR-Library
• SPEA2

Cites Work

• The Rectilinear Steiner Tree Problem is $NP$-Complete
• A survey on multi-net global routing for integrated circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction