Hypergraph partitioning and reordering for parallel sparse triangular solves and tensor decomposition

buir.advisorAykanat, Cevdet
dc.contributor.authorTorun, Tuğba
dc.date.accessioned2021-08-16T12:55:56Z
dc.date.available2021-08-16T12:55:56Z
dc.date.copyright2021-07
dc.date.issued2021-07
dc.date.submitted2021-08-03
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (Ph.D.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2021.en_US
dc.descriptionIncludes bibliographical references (leaves 122-134).en_US
dc.description.abstractSeveral scientific and real-world problems require computations with sparse ma-trices, or more generally, sparse tensors which are multi-dimensional arrays. For sparse matrix computations, parallelization of sparse triangular systems intro-duces significant challenges because of the sequential nature of the computations involved. One approach to parallelize sparse triangular systems is to use sparse triangular SPIKE (stSPIKE) algorithm, which was originally proposed for shared memory architectures. stSPIKE decouples the problem into independent smaller systems and requires the solution of a much smaller reduced sparse triangular sys-tem. We extend and implement stSPIKE for distributed-memory architectures. Then we propose distributed-memory parallel Gauss-Seidel (dmpGS) and ILU (dmpILU) algorithms by means of stSPIKE. Furthermore, we propose novel hy-pergraph partitioning models and in-block reordering methods for minimizing the size and nonzero count of the reduced systems that arise in dmpGS and dmpILU. For sparse tensor computations, tensor decomposition is widely used in the anal-ysis of multi-dimensional data. The canonical polyadic decomposition (CPD) is one of the most popular tensor decomposition methods, which is commonly computed by the CPD-ALS algorithm. Due to high computational and mem-ory demands of CPD-ALS, it is inevitable to use a distributed-memory-parallel algorithm for efficiency. The medium-grain CPD-ALS algorithm, which adopts multi-dimensional cartesian tensor partitioning, is one of the most successful dis-tributed CPD-ALS algorithms for sparse tensors. We propose a novel hypergraph partitioning model, CartHP, whose partitioning objective correctly encapsulates the minimization of total communication volume of multi-dimensional cartesian tensor partitioning. Extensive experiments on real-world sparse matrices and tensors validate the parallel scalability of the proposed algorithms as well as the effectiveness of the proposed hypergraph partitioning and reordering models.en_US
dc.description.degreePh.D.en_US
dc.description.statementofresponsibilityby Tuğba Torunen_US
dc.embargo.release2022-02-03
dc.format.extentxvii, 134 leaves : charts ; 30 cm.en_US
dc.identifier.itemidB151922
dc.identifier.urihttp://hdl.handle.net/11693/76437
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectHypergraph partitioningen_US
dc.subjectDistributed-memory architecturesen_US
dc.subjectSparse matrixen_US
dc.subjectSparse tensoren_US
dc.subjectSparse linear system solutionen_US
dc.subjectParallel sparse triangu-lar solveen_US
dc.subjectSPIKE algorithmen_US
dc.subjectParallel Gauss-Seidelen_US
dc.subjectIncomplete LU factorizationen_US
dc.subjectILU(0)en_US
dc.subjectTensor decompositionen_US
dc.subjectCanonical polyadic decomposition (CPD)en_US
dc.subjectCarte-sian partitioningen_US
dc.subjectCommunication volumeen_US
dc.titleHypergraph partitioning and reordering for parallel sparse triangular solves and tensor decompositionen_US
dc.title.alternativeParalel seyrek üçgensel sistemler ve tensör ayrıştırma için hiperçizge bölümleme ve yeniden sıralama yöntemlerien_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
10410355.pdf
Size:
23.36 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description: