By Topic

Minimum delay placement with influence of nets and hierarchical clustering

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
$31 $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

4 Author(s)
Tanaka, M.S. ; Syst. LSI Dev. Div., NEC Corp., Kawasaki, Japan ; Miyazawa, Y. ; Aizawa, H. ; Minowa, M.

This paper proposes a minimum delay placement employing a new net weighting method. A new factor to express the influence of a net on critical paths is incorporated in the conventional weight using slack allocation. This influence is defined for each net as the number of critical paths passing through it. An algorithm to calculate the influence is presented whose time complexity is O(n+b), where n is the number of nets and b is the number of blocks respectively. This net weighting method has been applied to the min-cut placement based on hierarchical clustering. The program has decreased the longest path delay by 21% for a benchmark containing 13141 blocks as compared with the case using only slack allocation

Published in:

Custom Integrated Circuits Conference, 1994., Proceedings of the IEEE 1994

Date of Conference:

1-4 May 1994