We discovered and mathematically proved that a partitioning problem under timing and capacity constraints can be formulated exactly as a Quadratic Boolean Programming Problem. This new formulation allows arbitrary component sizes arbitrary capacities of partitions, arbitrary interconnection costs and delay models between partitions. We then found a generalization/enhancement of Burkard's heuristic to efficiently solve the problem. Seven industrial circuits were used to compare our method against two other heuristics based on the traditional approach of component interchanges. Tests results showed the superiority of our new method in terms of both solution quality and CPU usage, for problems under very tight Timing and Capacity Constraints.
Title
Quadratic Boolean Programming For Performance- Driven System Partitioning
Published
1993-01-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
ERL-93-19
Type
Text
Extent
26 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
