1 / 6

Kernighan-Lin Algorithm

Kernighan-Lin Algorithm. Perform single KL pass on the following circuit: KL needs undirected graph (clique-based weighting). First Swap. Second Swap. Third Swap. Fourth Swap. Last swap does not require gain computation. Summary. Cutsize reduced from 5 to 3

rigel-burris
Download Presentation

Kernighan-Lin Algorithm

An Image/Link below is provided (as is) to download presentation 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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Kernighan-Lin Algorithm • Perform single KL pass on the following circuit: • KL needs undirected graph (clique-based weighting) Practical Problems in VLSI Physical Design

  2. First Swap Practical Problems in VLSI Physical Design

  3. Second Swap Practical Problems in VLSI Physical Design

  4. Third Swap Practical Problems in VLSI Physical Design

  5. Fourth Swap • Last swap does not require gain computation Practical Problems in VLSI Physical Design

  6. Summary • Cutsize reduced from 5 to 3 • Two best solutions found (solutions are always area-balanced) Practical Problems in VLSI Physical Design

More Related