Efficient SpMV Operation for Large and Highly Sparse Matrices using Scalable Multi-way Merge Parallelization
- 12 October 2019
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 347-358
- https://doi.org/10.1145/3352460.3358330
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Graphicionado: A high-performance and energy-efficient accelerator for graph analyticsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2016
- Design Considerations for Reliable High Temperature Operation of Wet Electrolytic Tantalum CapacitorsAdditional Conferences (Device Packaging, Hitec, Hiten, & Cicmt), 2014
- CACTI-3DD: Architecture-level modeling for 3D die-stacked DRAM main memoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- The university of Florida sparse matrix collectionACM Transactions on Mathematical Software, 2011
- Implementing sparse matrix-vector multiplication on throughput-oriented processorsPublished by Association for Computing Machinery (ACM) ,2009
- High-throughput Pipelined MergesortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- On the representation and multiplication of hypersparse matrices2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970
- Sorting networks and their applicationsPublished by Association for Computing Machinery (ACM) ,1968