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) |
|---|---|
| Title of host publication | Proceedings of the International Symposium on Physical Design |
| Publisher | ACM |
| Pages | 12-17 |
| Number of pages | 6 |
| 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 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
Network flow based multi-way partitioning with area and pin constraints. / Liu, Huiqun; Wong, Martin D F.
Proceedings of the International Symposium on Physical Design. ACM, 1997. p. 12-17.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Network flow based multi-way partitioning with area and pin constraints
AU - Liu, Huiqun
AU - Wong, Martin D F
PY - 1997
Y1 - 1997
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0030651819&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030651819&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0030651819
SP - 12
EP - 17
BT - Proceedings of the International Symposium on Physical Design
PB - ACM
ER -