Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2003, Pages 726-733

  Selvakkumaran, Navaratnasothie ^a   Karypis, George ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Congestion; Maximum Subdomain Degree; Partitioning; Placement

Indexed keywords

ALGORITHMS; COMPUTER AIDED LOGIC DESIGN; GRAPH THEORY; INTEGRATED CIRCUIT LAYOUT; INTERCONNECTION NETWORKS; ITERATIVE METHODS;

CONGESTION; MAXIMUM SUBDOMAIN DEGREE; MULTI-OBJECTIVE HYPERGRAPH PARTITIONING;

VLSI CIRCUITS;

EID: 0348040102     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccad.2003.159757     Document Type: Conference Paper

References (28)

1. C. Ababei, N. Selvakkumaran, K. Bazargan, and G. Karypis, Multi-objectivecircuit partitioning for cutsize and path-based delay minimization. In Proceedings of ICCAD, 2002. Also available on WWW at URL http://www.cs.umn.edu/̃karypis.
2. C. Alpert and A. Kahng. A hybrid multilevel/genetic approach for circuit partitioning. In Proceedings of the Fifth ACM/SIGDA Physical Design Workshop, pages 100-105, 1996.
3. C. J. Alpert. The ISPD98 circuit benchmark suite. In Proc. of the Intl. Symposium of Physical Design, pages 80-85, 1998.
4. C. J. Alpert, J. H. Huang, and A. B. Kahng. Multilevel circuit partitioning. In Proc. of the 34th ACM/IEEE Design Automation Conference, 1997.
5. C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning. Integration, the VLSI Journal, 19(1-2):1-81, 1995.
6. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Improved algorithms for hypergraph bipartitioning. In Asia and South Pacific Design Automation Conference, pages 661-666, 2000.
7. J. Cong and S. K. Lim. Multiway partitioning with pairwise movement. In Proceedings of ICCAD, pages 512-516, 1998.
8. J. Cong and M. L. Smith. A parallel bottom-up clustering algorithm with applications to circuit partitioning in vlsi design. In Proc. ACM/IEEE Design Automation Conference, pages 755-760, 1993.
9. R. Cooley, B. Mobasher, and J. Srivastava. Web mining: Information and pattern discovery on the world wide web. In International Conference on Tools with Artificial Intelligence, pages 558-567, Newport Beach, 1997. IEEE.
10. C. M. Fiduccia and R. M. Mattheyses. A linear time heuristic for improving network partitions. In In Proc. 19th IEEE Design Automation Conference, pages 175-181, 1982.
11. S. Hauck and G. Borriello. An evaluation of bipartitioning technique. In Proc. Chapel Hill Conference on Advanced Research in VLSI, 1995.
12. B. Hendrickson, R. Leland, and R. V. Driessche. Enhancing data locality by using terminal propagation. In Proceedings of the 29th Hawaii International Conference on System Science, 1996.
13. G. Karypis. Multilevel hypergraph partitioning. In J. Cong and J. Shinnerl, editors, Multilevel Optimization Methods for VLSI, chapter 6. Kluwer Academic Publishers, Boston, MA, 2002.
14. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: Application in vlsi domain. IEEE Transactions on VLSI Systems, 20(1), 1999. A short version appears in the proceedings of DAC 1997.
15. G. Karypis, E. Han, and V. Kumar. Chameleon: A hierarchical clustering algorithm using dynamic modeling. IEEE Computer, 32(8):68-75, 1999.
16. G. Karypis and V. Kumar. hMETIS 1.5: A hypergraph partitioning package. Technical report, Department of Computer Science, University of Minnesota, 1998. Available on the WWW at URL http:/www.cs.umn.edu/̃metis.
17. G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. VLSI Design, 2000.
18. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
19. P.Fishburn. Decision and Value Theory. J.Wiley & Sons, New York, 1964.
20. R.Keeney and H. Raiffa. Decisions with Multiple Objectives: Preferences and Value Tradeoffs. J.Wiley & Sons, New York, 1976.
21. L. Sanchis. Multiple-way network partitioning. IEEE Trans. On Computers, 38(1):62-81, 1989.
22. K. Schloegel, G. Karypis, and V. Kumar. A new algorithm for multi-objective graph partitioning. In Proceedings of EuroPar '99, pages 322-331, 1999.
23. S. Shekhar and D. R. Liu. Partitioning similarity graphs: A framework for declustering problmes. Information Systems Journal, 21(4), 1996.
24. H. D. Simon and S.-H. Teng. How good is recursive bisection? Technical Report RNR-93-012, NAS Systems Division, NASA, Moffet Field, CA, 1993.
25. M. Wang, S. K. Lim, J. Cong, and M. Sarrafzadeh. Multiway partitioning using bi-partition heuristics. In Proceedings of ASPDAC, pages 441-446. IEEE, January 2000.
26. S. Wichlund and E. J. Aas. On Multilevel Circuit Partitioning. In Intl. Conference on Computer Aided Design, 1998.
27. P. Yu. Multiple-Criteria Decision Making: Concepts, Techniques, and Extensions. Plenum Press, New York, 1985.
28. H. Zha, X. He, C. Ding, H. Simon, and M. Gu. Bipartite graph partitioning and data clustering. In CIKM, 2001.