Çavuşoğlu, Muhammed2020-08-102020-08-102020-072020-072020-07-27http://hdl.handle.net/11693/53932Cataloged from PDF version of article.Thesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2020.Includes bibliographical references (leaves 33-34).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.x, 34 leaves : charts ; 30 cm.Englishinfo:eu-repo/semantics/openAccessSparse matricesMaximum communication volumeBipartite graphsIndependent task assignment problemBin packing problemThesisB151905