An enhanced multilevel routing system

In this paper, we present several novel techniques that make the recently published multilevel routing scheme [19] more effective and complete. Our contributions include: (1) resource reservation for local nets during the coarsening process, (2) congestion-driven, graph-based Steiner tree construction during the initial routing and the refinement process and (3) multi-iteration refinement considering the congestion history. The experiments show that each of these techniques helps to improve the completion rate considerately. Compared to [19], the new routing system reduces the number of failed nets by 2× to 18×, with less than 50% increase in runtime in most cases.

• Type: Conference
• Year: 2002
• Where: ICCAD
• Authors: Jason Cong, Min Xie, Yan Zhang
• Keywords: Graph-based Steiner Tree, Hardware, ICCAD 2002, Initial Routing, Multilevel Routing Scheme