Run-Time Techniques for Parallelizing Sparse Matrix Problems

Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategies, which are typically used to parallelize such problems impose signi cant preprocessing overheads. This paper describes the runtime support required by new compilation techniques for sparse matrices and evaluates their performance, highlighting optimizations and improvements over previous techniques.

• Type: Conference
• Year: 1995
• Where: IRREGULAR
• Authors: Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, Emilio L. Zapata
• Keywords: Distributed And Parallel Computing, Inspector Executor Strategies, IRREGULAR 1995, Problems Impose Signi, Sparse Matrix Problems