Budget Management with Applications

8 years 10 months ago
Budget Management with Applications
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolatinggiven constraints. We propose the notion of slack sensitivity and budget gradient to demonstrate the characteristics of budget management. We develop a polynomial-time algorithm for the budget management problem, based on the maximum independent set of an established transitive graph. We show the comparison of our approach with the well-known zero-slack algorithm, and extend it to general weighted graphs. Applications to a class of problems in VLSI CAD are also discussed. Key Words. Budget management, Slack assignment, Directed acyclic graphs, Transitive graphs, Maximum independent set, Timing constraints, VLSI CAD.
Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastav
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2002
Authors Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastava, Majid Sarrafzadeh
Comments (0)