CSE 242A Integrated Circuit Layout Automation. Lecture: Partitioning Winter 2009 Chung-Kuan Cheng. Outlines. Motivations Formulations 2-way partitioning, multi-way partitioning, multilevel partitioning, replication cut, clustering. Net Modeling Algorithms
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
There exists an optimal linear placement
s.t. X and are separated.
Ei external connection
Ii internal connection
Prune the branches when size constraint is violated
Partial cost >= existing cost
# combinations = |V| ! / (|V/2)! (|V|/2)!
With an elegant implementation |V| <= 60 is feasible
Choose among the top k the best pair to swap
Update the cost, lock the moved nodes
Until all nodes are locked
Find the best sequence to swap
Until no more improvement
Adv: move more nodes a the same operation. Good for multi-way, hierarchical where cost function dominated by the way to handle the nets
s, nexts: configurations, T: real, count: integer
C and f are merged because their choices are taken by others