Fast multiplication of random dense matrices with sparse matrices

This work focuses on accelerating the multiplication of a dense random matrix with a (fixed) sparse matrix, which is frequently used in sketching algorithms. We develop a novel scheme that takes advantage of blocking and recomputation (on-the-fly random number generation) to accelerate this operatio...

Full description

Bibliographic Details

Published in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium pp. 52 - 62
Main Authors:	Liang, Tianyu, Murray, Riley, Buluc, Aydin, Demmel, James
Format:	Conference Proceeding
Language:	English
Published:	IEEE 27.05.2024
Subjects:	Distributed processing HPC Instruction sets Libraries Memory architecture Memory management Numerical Linear Algebra Scalability Sketching algorithm Sparse matrices
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!