Show simple item record

dc.contributor.advisorAykanat, Cevdeten_US
dc.contributor.authorJafari, Nazaninen_US
dc.date.accessioned2018-08-29T05:47:55Z
dc.date.available2018-08-29T05:47:55Z
dc.date.copyright2018-08
dc.date.issued2018-08
dc.date.submitted2018-08-15
dc.identifier.urihttp://hdl.handle.net/11693/47750
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2018.en_US
dc.descriptionIncludes bibliographical references (leaves 47-50).en_US
dc.description.abstractGraph partitioning is widely used for e cient parallelization of a variety of applications. Streaming graph partitioning is a one pass partitioning solution provided to overcome high computation costs of o ine graph partitioners. Even though these streaming algorithms can be used for successively repartitioning, aiming at further improvements in partitioning qualities, quality improvements is limited to few passes that make o ine graph partitioning tools still a desirable solution for graph partitioning due to the generated high quality partitions. We propose a multilevel approach using streaming algorithms that can alleviate tradeo between quality and performance in graph partitioning problem. Moreover, our OpenMP based multi-threaded implementation, can generate fast and highly scalable solutions compared to mt-metis, a multi-threaded solution for METIS, the state-of-the-art o ine high quality graph partitioning tool. Our results show that our method can produce up to fteen times faster and more scalable results in large graph datasets. We also show that our method can improve quality of partitions signi cantly compared to state-of-the-art streaming graph partitioning algorithm LDG after repartitioning several times. On average we produce partitions with 29% better qualities than LDG algorithm.en_US
dc.description.statementofresponsibilityby Nazanin Jafari.en_US
dc.format.extentx, 50 leaves : charts (some color) ; 30 cm.en_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectStreaming Graph Partitioningen_US
dc.subjectParallel Computingen_US
dc.subjectCombinatorial Scientific Computingen_US
dc.titleParallel streaming graph partitioning utilizing multilevel frameworken_US
dc.title.alternativeÇok düzeyli yapı kullanarak paralel akış çizge bölümlemeen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB158772
dc.embargo.release2020-08-13


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record