By Topic

An enhanced multilevel routing system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. Cong ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; M. Xie ; Y. Zhang

In this paper, we present several novel techniques that make the recently published multilevel routing scheme (J. Cong et al, Proc. IEEE Int. Conf. on CAD, pp. 396-403, 2001) 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 considerably. Compared to the authors' previous work, the new routing system reduces the number of failed nets by 2× to 18×, with less than 50% increase in runtime in most cases.

Published in:

Computer Aided Design, 2002. ICCAD 2002. IEEE/ACM International Conference on

Date of Conference:

10-14 Nov. 2002