Results 231 to 240 of about 43,136 (260)
Some of the next articles are maybe not open access.
Performance evaluation of Sparse Matrix-Matrix Multiplication
2013 23rd International Conference on Field programmable Logic and Applications, 2013The conventional matrix multiplication algorithms that are suitable for dense matrices do not perform well on the corresponding Sparse Matrix-Matrix Multiplication (SMMM) operation. In particular, they do not utilize the sparsity of the matrix. This paper describes a new technique for performing the SMMM operation using a novel storage format for ...
Shweta Jain-Mendon, Ron Sass
openaire +1 more source
A lower bound for matrix multiplication
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988It is proved that computing the product of two n*n matrices over the binary field requires at least 2.5n/sup 2/-O(n/sup 2/) multiplications. >
openaire +1 more source
On the Reuse of Additions in Matrix Multiplication
SIAM Journal on Computing, 1995Summary: We consider the problem of multiplying pairs of matrices by means of quadratic algorithms in terms of the reuse of additions. We show that if such an algorithm is to be significantly faster than the naive matrix multiplication method then it must reuse additions to a great extent.
openaire +1 more source
Sparse matrix-matrix multiplication on modern architectures
2012 19th International Conference on High Performance Computing, 2012Sparse matrix-sparse/dense matrix multiplications, spgemm and csrmm, respectively, among other applications find usage in various matrix formulations of graph problems. Considering the difficulties in executing graph problems and the duality between graphs and matrices, computations such as spgemm and csrmm have recently caught the attention of HPC ...
Kiran Kumar Matam +2 more
openaire +1 more source
Learning from Optimizing Matrix-Matrix Multiplication
2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2018We describe a learning process that uses one of the simplest examples, matrix-matrix multiplication, to illustrate issues that underlie parallel high-performance computing. It is accessible at multiple levels: simple enough to use early in a curriculum yet rich enough to benefit a more advanced software developer.
Devangi N. Parikh +3 more
openaire +1 more source
Optimization of Matrix-Matrix Multiplication Algorithm for Matrix-Panel Multiplication on Intel KNL
2022 IEEE/ACS 19th International Conference on Computer Systems and Applications (AICCSA), 2022Muhammad Rizwan +4 more
openaire +1 more source
Private Coded Matrix Multiplication
IEEE Transactions on Information Forensics and Security, 2020Minchul Kim +2 more
exaly
Anatomy of high-performance matrix multiplication
ACM Transactions on Mathematical Software, 2008Robert A Van De Geijn
exaly
Sparse matrix multiplication: The distributed block-compressed sparse row library
Parallel Computing, 2014Joost Vandevondele +2 more
exaly