Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
J. Parallel Distrib. Comput. 68 (2008) 609625 www.elsevier.com/locate/jpdc
 

Summary: J. Parallel Distrib. Comput. 68 (2008) 609­625
www.elsevier.com/locate/jpdc
Multi-level direct K-way hypergraph partitioning with
multiple constraints and fixed vertices
Cevdet Aykanata,
, B. Barla Cambazoglub
, Bora Uçarc,1
aComputer Engineering Department, Bilkent University, 06800 Bilkent, Ankara, Turkey
bDepartment of Biomedical Informatics, Ohio State University, Columbus, OH 43210, USA
cCERFACS, 42. Av. G. Coriolis, 31057 Toulouse, France
Received 27 July 2006; received in revised form 20 September 2007; accepted 25 September 2007
Available online 7 October 2007
Abstract
K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph
partitioning with multiple constraints and fixed vertices should be implemented using direct K-way refinement, instead of the widely adopted
recursive bisection paradigm. Our arguments are based on the fact that recursive-bisection-based partitioning algorithms perform considerably
worse when used in the multiple constraint and fixed vertex formulations. We discuss possible reasons for this performance degradation. We
describe a careful implementation of a multi-level direct K-way hypergraph partitioning algorithm, which performs better than a well-known
recursive-bisection-based partitioning algorithm in hypergraph partitioning with multiple constraints and fixed vertices. We also experimentally
show that the proposed algorithm is effective in standard hypergraph partitioning.

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences