Coloring for distributed-memory-parallel Gauss-Seidel algorithm

Simple item page
buir.advisorAykanat, Cevdet
dc.contributor.authorKoçak, Onur
dc.date.accessioned2019-09-11T10:17:24Z
dc.date.available2019-09-11T10:17:24Z
dc.date.copyright2019-09
dc.date.issued2019-09
dc.date.submitted2019-09-09
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2019.en_US
dc.descriptionIncludes bibliographical references (leaves 42-44).en_US
dc.description.abstractGauss-Seidel is a well-known iterative method for solving linear system of equations. The computations performed on Gauss-Seidel sweeps are sequential in nature since each component of new iterations depends on previously computed results. Graph coloring is widely used for extracting parallelism in Gauss-Seidel by eliminating data dependencies caused by precedence in the calculations. In this thesis, we present a method to provide a better coloring for distributed-memoryparallel Gauss-Seidel algorithm. Our method utilizes combinatorial approaches including graph partitioning and balanced graph coloring in order to decrease the number of colors while maintaining a computational load balance among the color classes. Experiments performed on irregular sparse problems arising from various scientific applications show that our model effectively reduces the required number of colors thus the number of parallel sweeps in the Gauss-Seidel algorithm.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityby Onur Koçaken_US
dc.embargo.release2020-03-01
dc.format.extentx, 44 leaves : charts ; 30 cm.en_US
dc.identifier.itemidB151793
dc.identifier.urihttp://hdl.handle.net/11693/52416
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectParallel computingen_US
dc.subjectGauss-Seidel methoden_US
dc.subjectParallel Gauss-Seidel algorithmen_US
dc.subjectDistributed memory algorithmen_US
dc.subjectGraph coloringen_US
dc.titleColoring for distributed-memory-parallel Gauss-Seidel algorithmen_US
dc.title.alternativeDağıtık-bellek-paralel Gauss-Seidel algoritması için renklendirmeen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
MScThesis_OnurKocak-Coloring_For_Distributed-Memory-Parallel_Gauss-Seidel_Algorithm.pdf
Size:
1.51 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Dept. of Computer Engineering - Master's degree