Multi-way partitioning using bi-partition heuristics

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2000, Pages 667-672

  Wang, Maogang ^a   Lim, Sung ^b   Cong, Jason ^b   Sarrafzadeh, Majid ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAD TOOL; HIERARCHICAL APPROACH; MULTI-PASS; PARTITION PROBLEM; UPPER BOUND;

COSTS;

COMPUTER AIDED DESIGN;

EID: 84884681382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/368434.368865     Document Type: Conference Paper

References (20)

1. C. J. Alpert, J. H. Huang, and A. B. Kahng. "Multilevel Circuit Partitioning". In Design Automation Conference, pages 530-533. IEEE/ACM, 1997.
2. C. J. Alpert and A. B. Kahng. "Geometric Embeddings for Faster and Better Multi-Way Netlist Partitioning". In Design Automation Conference, pages 743-748. IEEE/ACM, 1983.
3. C. J. Alpert and A. B. Kahng. "Recent Directions in Netlist Partitioning". Integration, the VLSI Journal, 19:1-81, 1995.
4. C. K. Cheng and Y. C. A. Wei. "An improved two-way partitioning algorithm with stable performance". IEEE Transactions on Computer Aided Design, 10(12):1502-1511, 1991.
5. J. Cong, W. Labio, and N. Shivakumar. "Multi-way VLSI circuit partitioning based on dual net representation". In International Conference on Computer-Aided Design, pages 56-62, November 1994.
6. J. Cong, H. P. Li, S. K. Lim, T. Shibuya, and D. Xu. "Large Scale Circuit Partitioning with Loose/Stable Net Removal and Signal Flow Based Clustering". In International Conference on Computer-Aided Design, pages 441-446. IEEE, 1997.
7. J. Cong and S. K. Lim. "Multiway Partitioning with Pairwire Movement". In International Conference on Computer-Aided Design, pages 512-516, 1998.
8. D. Dutt and W. Deng. "VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques". In International Conference on Computer-Aided Design, pages 194-200. IEEE, 1996.
9. C. M. Fiduccia and R. M. Mattheyes. "A Linear Time Heuristic for Improving Network Partitions". In Design Automation Conference, pages 175-181, 1982.
10. L. Hagen and A. B. Kahng. "Fast Spectral Methods for Ratio Cut Partitioning and Clustering". In International Conference on Computer-Aided Design. IEEE, 1991.
11. S. Hauck and G. Boriello. "An Evaluation of Bipartitioning Techniques". In Chapel Hill Conference on Advanced Research in VLSI, 1995.
12. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. "Multilevel Hypergraph Partitioning: Application in VLSI Domain". In Design Automation Conference, pages 526-529. IEEE/ACM, 1997.
13. G. Karypis and V. Kumar. "Multilevel k-way Hypergraph Partitioning". In Design Automation Conference, pages 343-348, 1999.
14. B.W. Kernighan and S. Lin. "An Efficient Heuristic Procedure for Partitioning Graphs". Bell System Technical Journal, 49:291-307, Feburary 1970.
15. M. Kiwi, D. Spielman, and S. H. Teng. "Min-Max-Boundary Domain Decomposition". In Annual International Computing and Combinatorics Conference, 1998.
16. L. A. Sanchis. "Multi-Way Network Partitioning". IEEE Transactions on Computers, 38(1):62-81, Jan. 1989.
17. H. D. Simon and S. H. Teng. "How Good Is Recursive Bisection?". In SIAM Journal of Scientific Computing, 1996.
18. P. R. Suaris and G. Kedem. "Quadrisection: A New Approach to Standard Cell Layout". In Design Automation Conference, pages 474-477. IEEE/ACM, 1987.
19. P. R. Suaris and G. Kedem. "Standard Cell Placement by Quadrisection". In International Conference on Computer-Aided Design, pages 612-615. IEEE/ACM, 1987.
20. N. S. Woo and J. Kim. "An Efficient Method of Partitioning Circuits for Multiple-FPGA Implementation". In Design Automation Conference, pages 202-207. IEEE/ACM, 1993.