Send volume balancing in reduce operations
buir.advisor | Aykanat, Cevdet | |
dc.contributor.author | Çavuşoğlu, Muhammed | |
dc.date.accessioned | 2020-08-10T11:33:14Z | |
dc.date.available | 2020-08-10T11:33:14Z | |
dc.date.copyright | 2020-07 | |
dc.date.issued | 2020-07 | |
dc.date.submitted | 2020-07-27 | |
dc.description | Cataloged from PDF version of article. | en_US |
dc.description | Thesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2020. | en_US |
dc.description | Includes bibliographical references (leaves 33-34). | en_US |
dc.description.abstract | We 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.provenance | Submitted 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.provenance | Made 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-27 | en |
dc.description.statementofresponsibility | by Muhammed Çavuşoğlu | en_US |
dc.format.extent | x, 34 leaves : charts ; 30 cm. | en_US |
dc.identifier.itemid | B151905 | |
dc.identifier.uri | http://hdl.handle.net/11693/53932 | |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Sparse matrices | en_US |
dc.subject | Maximum communication volume | en_US |
dc.subject | Bipartite graphs | en_US |
dc.subject | Independent task assignment problem | en_US |
dc.subject | Bin packing problem | en_US |
dc.title | Send volume balancing in reduce operations | en_US |
dc.title.alternative | İndirgeme işlemlerinde gönderme yükünün dengelenmesi | en_US |
dc.type | Thesis | en_US |
thesis.degree.discipline | Computer Engineering | |
thesis.degree.grantor | Bilkent University | |
thesis.degree.level | Master's | |
thesis.degree.name | MS (Master of Science) |