Simulated Annealing
Opened this issue · 1 comments
danielyang2055 commented
- Initial fill insertion
- Reduce fill to minimize cost in each bin
- Metal fill again (probably using random fill with some random behavior)
- Go back to step 2
(loop forever)
danielyang2055 commented
For Step 2:
- Determine critical net, non-critical net and metal fill, and ground net
- Cost of a fill is calculated by the overlap area with weight and capacitance parameters
- Density reduction is done in each bin
- Sort metal fill by cost/metal_area = cp (get cp list)
- Choose a metal fill with largest cp to reduce first
- Rectangle Resize (return scaled rectangle) (up, dw, lt, rt)
- Rectangle min width, max width check (DRC)
- Use Rectangle Resize to do multiple tries and choose the best reduction
- Delete the fill if necessary.
- Reduced metal fill has new cp value
- loop until bin density reach minimum requirement.