Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices

buir.contributor.authorAykanat, Cevdet
dc.citation.epage625en_US
dc.citation.issueNumber5en_US
dc.citation.spage609en_US
dc.citation.volumeNumber68en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.contributor.authorCambazoglu, B. B.en_US
dc.contributor.authorUçar, B.en_US
dc.date.accessioned2016-02-08T10:09:20Z
dc.date.available2016-02-08T10:09:20Z
dc.date.issued2008-05en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractK-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. © 2007 Elsevier Inc. All rights reserved.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:09:20Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2008en
dc.identifier.doi10.1016/j.jpdc.2007.09.006en_US
dc.identifier.issn0743-7315en_US
dc.identifier.urihttp://hdl.handle.net/11693/23129en_US
dc.language.isoEnglishen_US
dc.publisherAcademic Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.jpdc.2007.09.006en_US
dc.source.titleJournal of Parallel and Distributed Computingen_US
dc.subjectDirect K-way refinementen_US
dc.subjectFixed verticesen_US
dc.subjectHypergraph partitioningen_US
dc.subjectMulti-constrainten_US
dc.subjectMulti-level paradigmen_US
dc.subjectRecursive bisectionen_US
dc.subjectAlgorithmsen_US
dc.subjectComputational geometryen_US
dc.subjectNatural sciences computingen_US
dc.subjectRecursive functionsen_US
dc.titleMulti-level direct K-way hypergraph partitioning with multiple constraints and fixed verticesen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices.pdf
Size:
512.07 KB
Format:
Adobe Portable Document Format
Description:
Full printable version