Show simple item record

dc.contributor.advisorAykanat, Cevdet
dc.contributor.authorYazıcı, Volkan
dc.date.accessioned2016-01-08T18:14:21Z
dc.date.available2016-01-08T18:14:21Z
dc.date.issued2010
dc.identifier.urihttp://hdl.handle.net/11693/15156
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2010.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2010.en_US
dc.descriptionIncludes bibliographical references leaves 40-47.en_US
dc.description.abstractReplication is a widely used technique in information retrieval and database systems for providing fault-tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning are proposed for various problems arising in information retrieval and database systems. We consider the possibility of using vertex replication to improve the quality of hypergraph partitioning. In this study, we focus on the Balance Preserving Min-Cut Replication Set (BPMCRS) problem, where we are initially given a maximum replication capacity and a K-way hypergraph partition with an initial imbalance ratio. The objective in the BPMCRS problem is finding optimal vertex replication sets for each part of the given partition such that the initial cutsize of the partition is improved as much as possible and the initial imbalance is either preserved or reduced under the given replication capacity constraint. In order to address the BPMCRS problem, we propose a model based on a unique blend of coarsening and integer linear programming (ILP) schemes. This coarsening algorithm is based on the Dulmage-Mendelsohn decomposition. Experiments show that the ILP formulation coupled with the Dulmage-Mendelsohn decomposition-based coarsening provides high quality results in feasible execution times for reducing the cost of a given K-way hypergraph partition.en_US
dc.description.statementofresponsibilityYazıcı, Volkanen_US
dc.format.extentx, 47 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectPartitioningen_US
dc.subjectHypergraph partitioningen_US
dc.subjectReplicationen_US
dc.subject.lccQA165 .Y39 2010en_US
dc.subject.lcshPartitions (Mathematics)en_US
dc.subject.lcshHypergraphs.en_US
dc.subject.lcshGraph theory.en_US
dc.titleBalance preserving min-cut replication set for a K-way hypergraph partitioningen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB122806


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record