The full text of this item is not available at this time because the student has placed this item under an embargo for a period of time. The Libraries are not authorized to provide a copy of this work during the embargo period, even for Texas A&M users with NetID.
Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework
MetadataShow full item record
Applications of matrices are found in most scientiﬁc ﬁelds, such as physics, computer graphics, numerical analysis, etc. The high applicability of matrix algorithms and representations make them an important component in any parallel programming language, therefore matrix frameworks are a continuous research eﬀort in high performance computing. This work focuses on a generic matrix framework in the STAPL library. First, we extend the STAPL library by adding a sparse matrix container. Second we implement SUMMA, the parallel matrix-multiplication algorithm, for ﬁne grained computations. Then, implement parallel matrix-matrix algorithms for the sparse matrix container. Finally, we conduct experimental studies for each of the components we have implemented and discuss the ﬁndings. Experiments are conducted on a Cray XE6m cluster. Experimental studies consist of multiple matrix and data inputs that showcase and stress the matrix models implemented. We ﬁnd that the sparse matrix container outperforms its dense counterpart in sparse in-puts, and vice versa. Both containers, and the matrix summa implementation show scalability up to 512 cores.
Hoxha, Dielli (2016). Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework. Master's thesis, Texas A & M University. Available electronically from