Show simple item record

dc.contributor.authorOguz Selvitopi, R.en_US
dc.contributor.authorTurk, A.en_US
dc.contributor.authorAykanat, C.en_US
dc.date.accessioned2016-02-08T09:47:34Z
dc.date.available2016-02-08T09:47:34Z
dc.date.issued2012en_US
dc.identifier.issn7437315en_US
dc.identifier.urihttp://hdl.handle.net/11693/21524
dc.description.abstractHypergraph partitioning (HP) and replication are diverse but powerful tools that are traditionally applied separately to minimize the costs of parallel and sequential systems that access related data or process related tasks. When combined together, these two techniques have the potential of achieving significant improvements in performance of many applications. In this study, we provide an approach involving a tool that simultaneously performs replication and partitioning of the vertices of an undirected hypergraph whose vertices represent data and nets represent task dependencies among these data. In this approach, we propose an iterative-improvement-based replicated bipartitioning heuristic, which is capable of move, replication, and unreplication of vertices. In order to utilize our replicated bipartitioning heuristic in a recursive bipartitioning framework, we also propose appropriate cut-net removal, cut-net splitting, and pin selection algorithms to correctly encapsulate the two most commonly used cutsize metrics. We embed our replicated bipartitioning scheme into the state-of-the-art multilevel HP tool PaToH to provide an effective and efficient replicated HP tool, rpPaToH. The performance of the techniques proposed and the tools developed is tested over the undirected hypergraphs that model the communication costs of parallel query processing in information retrieval systems. Our experimental analysis indicates that the proposed technique provides significant improvements in the quality of the partitions, especially under low replication ratios. © 2012 Elsevier Inc. All rights reserved.en_US
dc.language.isoEnglishen_US
dc.source.titleJournal of Parallel and Distributed Computingen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.jpdc.2012.01.004en_US
dc.subjectHypergraph partitioningen_US
dc.subjectIterative improvement heuristicen_US
dc.subjectRecursive bipartitioningen_US
dc.subjectReplicationen_US
dc.subjectUndirected hypergraphsen_US
dc.subjectHyper graphen_US
dc.subjectHypergraph partitioningen_US
dc.subjectIterative improvementsen_US
dc.subjectRecursive bipartitioningen_US
dc.subjectReplicationen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectInformation retrievalen_US
dc.subjectInformation retrieval systemsen_US
dc.subjectGraph theoryen_US
dc.titleReplicated partitioning for undirected hypergraphsen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineering
dc.citation.spage547en_US
dc.citation.epage563en_US
dc.citation.volumeNumber72en_US
dc.citation.issueNumber4en_US
dc.identifier.doi10.1016/j.jpdc.2012.01.004en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record