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 |
|---|---|
| Title of host publication | 1997 international symposium on Physical design, ISPD '97 |
| Publisher | Association for Computing Machinery (ACM) |
| Pages | 12-17 |
| Number of pages | 6 |
| ISBN (Print) | 9780897919272 |
| DOIs | |
| Publication status | Published - Apr 1997 |
| Event | 1997 International Symposium on Physical Design, ISPD 1997 - Napa Valley, United States Duration: 14 Apr 1997 → 16 Apr 1997 https://dl.acm.org/doi/proceedings/10.1145/267665 (Conference proceedings ) |
Publication series
| Name | Proceedings of 1997 international symposium on Physical design, ISPD '97 |
|---|
Symposium
| Symposium | 1997 International Symposium on Physical Design, ISPD 1997 |
|---|---|
| Country/Territory | United States |
| City | Napa Valley |
| Period | 14/04/97 → 16/04/97 |
| Internet address |
|
Fingerprint
Dive into the research topics of 'Network flow based multi-way partitioning with area and pin constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver