By Topic

Buffered interconnect tree optimization using Lagrangian relaxation and dynamic programming

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

2 Author(s)
Shih-Yih Lai ; Avant! Corp., CA, USA ; Baldick, R.

This paper presents a new synthesis method, based on combining bottom-up dynamic programming and Lagrangian relaxation, for finding effective solutions to a delay-constrained buffered interconnect tree. By introducing redundant length constraints and relaxing them using Lagrangian relaxation, our approach decomposes the original problem into a series of dynamic programming sub-problems to synthesize the buffered interconnect tree. We then use an iterative strategy to minimize the interconnect cost and also to satisfy timing and length constraints

Published in:

Computer Design, 2001. ICCD 2001. Proceedings. 2001 International Conference on

Date of Conference: