Problems /
Floorplanning /
Min-cut partitioning
Min-cut partitioning
Floorplanning
medium
interactive · in-browser
Partition this block for hierarchy: sort the sub-blocks into two regions so that as few nets as possible are cut across the boundary. A cut net has to be carried between the regions, which costs wiring and timing, so a good partition keeps tightly-connected logic together. Keep the two regions balanced in area.
The blocks form two tightly-connected groups but start scrambled across the boundary, so many nets are cut (shown in red).
- Cut nets at or under target - drag the tightly-connected blocks into the same region. A red net crosses the boundary; group its blocks to uncut it.
- Regions balanced - keep the two regions roughly equal in total block area; do not dump everything on one side.
- Legality - blocks inside the die, not overlapping.
Fewer cuts scores higher. Submit design once balanced and under target.