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.
Selvakkumaran, Navaratnasothie; Karypis, George.
Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization.
Retrieved from the University of Minnesota Digital Conservancy,
Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.