A new strategy for simultaneous escape based on boundary routing

Lijuan Luo, Tan Yan, Qiang Ma, Martin D.F. Wong, Toshiyuki Shibuya

Research output: Contribution to journalArticlepeer-review


Simultaneous escape routing on dense circuit boards is a very challenging task and a great amount of manual effort is still needed in order to achieve high routability. In this paper, we present a new simultaneous escape routing algorithm which is based upon a novel boundary routing approach. Our algorithm can solve complicated escape problems in a very short time. For a set of industrial escape problems, our algorithm successfully solved all of them while Cadence Allegro PCB router was only able to complete the routing of half of the problems. In addition, we propose a clustering strategy targeting at large escape routing problems. Experimental results show that this clustering strategy can significantly cut down the runtime of our router when solving large problems.

Original languageEnglish (US)
Article number5689348
Pages (from-to)205-214
Number of pages10
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Issue number2
StatePublished - Feb 2011


  • Boundary routing
  • computer-aided design
  • escape routing
  • printed circuit board (PCB)

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering


Dive into the research topics of 'A new strategy for simultaneous escape based on boundary routing'. Together they form a unique fingerprint.

Cite this