{'fraction_non_alphanumeric': 0.030012004801920768, 'fraction_numerical': 0.027611044417767107, 'mean_word_length': 5.515625, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Library for Parallel Sparse Matrix Vector Multiplies

We provide parallel matrix-vector multiply routines for 1D and 2D partitioned sparse square and rectangular matrices. We clearly give pseudocodes that perform necessary initializations for parallel execution. We show how to maximize overlapping between communication and computation through the proper usage of compressed sparse row and compressed sparse column formats of the sparse matrices. We give pseudocodes for multiplication routines which benefit from such overlaps. Technical Report: No: BU-CE-0506 Department of Computer Engineering, Bilkent University, 06800 Ankara, Turkey. Available at http://www.cs.bilkent.edu.tr/publications/ Date: August 31, 2005. This work is partially supported by the Scientific and Technical Research Council of Turkey under grant 103E028