Show simple item record

dc.contributor.advisorAykanat, Cevdet
dc.contributor.authorKaraca, Evren
dc.date.accessioned2016-07-01T11:04:47Z
dc.date.available2016-07-01T11:04:47Z
dc.date.issued2006
dc.identifier.urihttp://hdl.handle.net/11693/29776
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractHypergraph partitioning is a process that is being used to find solutions for optimization problems in various areas, including parallel volume rendering, parallel information retrieval and VLSI circuit design. While the current partitioning methods are adequate for hypergraphs up to certain size, these methods start to fail once the problem size exceeds this threshold. In this thesis we introduce ParPaToH, a parallel p-way hypergraph partitioning tool that makes use of a 2-D decomposition to reduce the communication overhead and implements a parallel-computing friendly version of the accepted multi-level partitioning paradigm to generate its partitioning. We present new concepts in hypergraph partitioning that lead to a coarse-grain parallel solution. Finally, we discuss the implementation of the tool in detail and present experimental results to demonstrate its effectiveness.en_US
dc.description.statementofresponsibilityKaraca, Evrenen_US
dc.format.extentx, 49 leaves, illustrationsen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMultilevel hypergraph partitioningen_US
dc.subjectParallel computingen_US
dc.subject.lccQA166 .K37 2006en_US
dc.subject.lcshGraph theory.en_US
dc.titleParpatoh : A 2D-parallel hypergraph partitioning toolen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB095690


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record