Abstract
Network flow is an excellent approach to finding min-cuts because of the celebrated max-flow min-cut theorem. However, for a long time, it was perceived as computationally expensive and deemed impractical for circuit partitioning. Only until recently, FBB successfully applied network flow to two-way balanced partitioning and for the first time demonstrated that network flow was a viable approach to circuit partitioning. In this paper, we present FBB-MW, which is an extension of FBB, to solve the problem of multi-way partitioning with area and pin constraints. Experimental results show that FBB-MW outperforms the FM-based MW-part program in the TAPIR package.
| Original language | English (US) |
|---|---|
| Pages | 12-17 |
| Number of pages | 6 |
| DOIs | |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 1st International Symposium on Physical Design, ISPD - Napa Valley, CA, USA Duration: Apr 14 1997 → Apr 16 1997 |
Other
| Other | Proceedings of the 1997 1st International Symposium on Physical Design, ISPD |
|---|---|
| City | Napa Valley, CA, USA |
| Period | 4/14/97 → 4/16/97 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering