Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Circuit delay optimization as a multiple choice linear knapsack program

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Karkowski, I. ; Fac. of Electr. Eng., Delft Univ. of Technol., Netherlands

An efficient way for optimizing timing under constraints as an integer programming problem is presented. Actually, a surrogate dual of a mathematical programming problem is solved within global enumeration schemes. The kernel of each iteration is nothing else than an instance of the multiple choice linear knapsack problem, for which a O( n) algorithm exists. Arbitrary, discrete cost-delay functions for modeling circuits, which are especially suitable for Sea of Gates designs are used. Experiments confirm usefulness of this approach

Published in:

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Date of Conference:

22-25 Feb 1993