Communication balancing in parallel sparse matrix-vector multiplication

Electronic Transactions on Numerical Analysis

Volumn 21, Issue , 2005, Pages 47-65

  Bisseling, Rob H ^a   Meesen, Wouter ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Bulk synchronous parallel; Matrix vector multiplication; Parallel computing; Sparse matrix; Vector partitioning

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS; VECTOR QUANTIZATION;

BULK SYNCHRONOUS PARALLEL; MATRIX-VECTOR MULTIPLICATION; SPARSE MATRIX; VECTOR PARTITIONING;

MATRIX ALGEBRA;

EID: 31444439570     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. R. BARRETT, M. BERRY, T. F. CHAN, J. DEMMEL, J. DONATO, J. DONGARRA, V. EIJKHOUT, R. POZO, C. ROMINE, AND H. VAN DER VORST, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, PA, 1994.
2. E. BOMAN, K. DEVINE, R. HEAPHY, B. HENDRICKSON, M. HEROUX, AND R. PREIS, Parallel repartitioning for optimal solver performance, Technical Report SAND2004-0365, Sandia National Laboratories, Albuquerque, NM, Feb. 2004.
3. A. E. CALDWELL, A. B. KAHNG, AND I. L. MARKOV, Improved algorithms for hypergraph biparritioning, in Proceedings Asia and South Pacific Design Automation Conference, ACM Press, New York, 2000, pp. 661-666.
4. Ü. V. CATALYÜREK AND C. AYKANAT, Decomposing irregularly sparse matrices for parallel matrix-vector multiplications, in Proceedings Third International Workshop on Solving Irregularly Structured Problems in Parallel (Irregular 1996), A. Ferreira, J. Rolim, Y. Saad, and T. Yang, eds., vol. 1117 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1996, pp. 75-86.
5. _, Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, IEEE Trans. Parallel Distrib. Systems, 10 (1999), pp. 673-693.
6. _, PaToH: A multilevel hypergraph partitioning tool, version 3.0, technical report, Department of Computer Engineering, Bilkent University, Ankara, Turkey, 1999.
7. _, A fine-grain hypergraph model for 2D decomposition of sparse matrices, in Proceedings Eighth International Workshop on Solving Irregularly Structured Problems in Parallel (Irregular 2001), IEEE Press, Los Alamitos, CA, 2001, p. 118.
8. _, A hypergraph-partitioning approach for coarse-grain decomposition, in Proceedings Supercomputing 2001, ACM Press, New York, 2001, p. 42.
9. T. A. DAVIS, University of Florida sparse matrix collection, Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, 1994-2004, online collection, http://www.cise.ufl.edu/research/ sparse/matrices.
10. K. DEVINE, E. BOMAN, R. HEAPHY, B. HENDRICKSON, AND C. VAUGHAN, Zoltan data management services for parallel dynamic applications, Computing in Science and Engineering, 4(2) (2002), pp. 9097.
11. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
12. _, The Rutherford-Boeing sparse matrix collection, Technical Report TR/PA/97/36, CERFACS, Toulouse, France, Sept. 1997.
13. C. M. FIDUCCIA AND R. M. MATTHEYSES, A linear-time heuristic for improving network partitions, in Proceedings of the 19th IEEE Design Automation Conference, IEEE Press, Los Alamitos, CA, 1982, pp. 175-181.
14. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
15. Y. F. HU, K. C. F. MAGUIRE, AND R. J. BLAKE, A multilevel unsymmetric matrix ordering algorithm for parallel process simulation, Computers and Chemical Engineering, 23 (2000), pp. 1631-1647.
16. G. KARYPIS AND V. KUMAR, Multilevel k-way hypergraph partitioning, in Proceedings 36th ACM/IEEE Conference on Design Automation, ACM Press, New York, 1999, pp. 343-348.
17. A. PINAR AND B. HENDRICKSON, Graph partitioning for complex objectives, in Proceedings Eighth International Workshop on Solving Irregularly Structured Problems in Parallel (Irregular 2001), IEEE Press, Los Alamitos, CA, 2001, p. 121.
18. _, Exploiting flexibly assignable work to improve load balance, in Proceedings 14th Annual ACM Symposium on Parallel Algorithms and Architectures, 2002, pp. 155-163.
19. A. TRIFUNOVIC AND W. J. KNOTTENBELT, A parallel algorithm for multilevel k-way hypergraph partitioning, in Proceedings Third International Symposium on Parallel and Distributed Computing, Cork, Ireland, July 2004.
20. B. UÇAR AND C. AYKANAT, Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies, SIAM J. Sci. Comput., 25 (2004), pp. 1837-1859.
21. L. G. VALIANT, A bridging model for parallel computation, Communications of the ACM, 33(8) (1990), pp. 103-111.
22. A. VAN HEUKELUM, G. T. BARKEMA, AND R. H. BISSELING, DNA electrophoresis studied with the cage model, J. Comput. Phys., 180 (2002), pp. 313-326.
23. B. VASTENHOUW AND R. H. BISSELING, A two-dimensional data distribution method for parallel sparse matrix-vector multiplication, SIAM Rev., 47 (2005), pp. 67-95.