Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
2003-04-17
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
Published Date
2003-04-17
Publisher
Type
Report
Abstract
In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both the cut and the maximum subdomain degree aresimultaneously minimized. This type of partitionings are critical for existing and emerging applications in VLSI CAD as they allow to both minimize and evenly distribute the interconnects across the physical devices. Our experimentalevaluation on the ISPD98 benchmark show that our algorithms produce solutions that when compared against those produced by hMtis have a maximum subdomain degree that is lower by 5% to 54% while achieving comparable quality in terms of cut.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Selvakkumaran, Navaratnasothie; Karypis, George. (2003). Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215562.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.