Send volume balancing in reduce operations

Simple item page
buir.advisorAykanat, Cevdet
dc.contributor.authorÇavuşoğlu, Muhammed
dc.date.accessioned2020-08-10T11:33:14Z
dc.date.available2020-08-10T11:33:14Z
dc.date.copyright2020-07
dc.date.issued2020-07
dc.date.submitted2020-07-27
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2020.en_US
dc.descriptionIncludes bibliographical references (leaves 33-34).en_US
dc.description.abstractWe investigate balancing send volume in applications that involve reduce operations. In such applications, a given computational-task-to-processor mapping produces partial results generated by processors to be reduced possibly by other processors, thus incurring inter-processor communication. We define the reduce communication task assignment problem as assigning the reduce communication tasks to processors in a way that minimizes the send volume load of the maximally loaded processor. We propose one novel independent-task-assignment-based algorithm and four novel bin-packing-based algorithms to solve the reduce communication task assignment problem. We validate our proposed algorithms on two kernel operations: sparse matrix-sparse matrix multiplication (SpGEMM) and sparse matrix-matrix multiplication (SpMM). Experimental results show improvements of up to 23% on average for the maximum communication volume cost metric in SpGEMM and up to 12% improvement on average in SpMM.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2020-08-10T11:33:14Z No. of bitstreams: 1 10344632.pdf: 506231 bytes, checksum: 80a1d9bb9598ac04bdfb1686e7d302eb (MD5)en
dc.description.provenanceMade available in DSpace on 2020-08-10T11:33:14Z (GMT). No. of bitstreams: 1 10344632.pdf: 506231 bytes, checksum: 80a1d9bb9598ac04bdfb1686e7d302eb (MD5) Previous issue date: 2020-07-27en
dc.description.statementofresponsibilityby Muhammed Çavuşoğluen_US
dc.format.extentx, 34 leaves : charts ; 30 cm.en_US
dc.identifier.itemidB151905
dc.identifier.urihttp://hdl.handle.net/11693/53932
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectSparse matricesen_US
dc.subjectMaximum communication volumeen_US
dc.subjectBipartite graphsen_US
dc.subjectIndependent task assignment problemen_US
dc.subjectBin packing problemen_US
dc.titleSend volume balancing in reduce operationsen_US
dc.title.alternativeİndirgeme işlemlerinde gönderme yükünün dengelenmesien_US
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
10344632.pdf
Size:
494.37 KB
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

Graduate School of Engineering and Science