Run-Time Techniques for Parallelizing Sparse Matrix Problems

  title={Run-Time Techniques for Parallelizing Sparse Matrix Problems},
  author={Manuel Ujaldon and Shamik D. Sharma and Joel H. Saltz and Emilio L. Zapata},
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. 
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
15 Citations
6 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 15 extracted citations

Similar Papers

Loading similar papers…