Scaling sparse matrix-matrix multiplication in the accumulo database
Demirci, Gündüz Vehbi
Distributed and Parallel Databases
Item Usage Stats
MetadataShow full item record
We propose and implement a sparse matrix-matrix multiplication (SpGEMM) algorithm running on top of Accumulo’s iterator framework which enables high performance distributed parallelism. The proposed algorithm provides write-locality while ingesting the output matrix back to database via utilizing row-by-row parallel SpGEMM. The proposed solution also alleviates scanning of input matrices multiple times by making use of Accumulo’s batch scanning capability which is used for accessing multiple ranges of key-value pairs in parallel. Even though the use of batch-scanning introduces some latency overheads, these overheads are alleviated by the proposed solution and by using node-level parallelism structures. We also propose a matrix partitioning scheme which reduces the total communication volume and provides a balance of workload among servers. The results of extensive experiments performed on both real-world and synthetic sparse matrices show that the proposed algorithm scales significantly better than the outer-product parallel SpGEMM algorithm available in the Graphulo library. By applying the proposed matrix partitioning, the performance of the proposed algorithm is further improved considerably.
Parallel and distributed computing
Sparse matrix–matrix multiplication
Published Version (Please cite this version)https://dx.doi.org/10.1007/s10619-019-07257-y
Showing items related by title, author, creator and subject.
Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies Uçar, B.; Aykanat, Cevdet (SIAM, 2004)This paper addresses the problem of one-dimensional partitioning of structurally unsymmetric square and rectangular sparse matrices for parallel matrix-vector and matrix-transpose-vector multiplies. The objective is to ...
Locality-aware parallel sparse matrix-vector and matrix-transpose-vector multiplication on many-core processors Karsavuran, M. O.; Akbudak K.; Aykanat, Cevdet (Institute of Electrical and Electronics Engineers, 2016)Sparse matrix-vector and matrix-transpose-vector multiplication (SpMMTV) repeatedly performed as z ← ATx and y ← A z (or y ← A w) for the same sparse matrix A is a kernel operation widely used in various iterative solvers. ...
Matrix-geometric solutions of M/G/1-type Markov chains: A unifying generalized state-space approach Akar, N.; Oǧuz, N.C.; Sohraby, K. (1998)In this paper, we present an algorithmic approach to find the stationary probability distribution of M/G/1-type Markov chains which arise frequently in performance analysis of computer and communication networ ks. The ...