Exact sparse matrix-vector multiplication on GPU's and multicore architectures

PASCO'2010 - Proceedings of the 2010 International Workshop on Parallel Symbolic Computation

Volumn , Issue , 2010, Pages 80-88

  Boyer, Brice ^a   Dumas, Jean Guillaume ^a   Giorgi, Pascal ^b  

^a UNIV GRENOBLE ALPES   (France)

^b LIRMM   (France)

Author keywords

Block Wiedemann; Finite field; Parallelism; Rank; Sparse matrix vector multiplication

Indexed keywords

GRAPHICS PROCESSING UNIT; MATRIX ALGEBRA; SMART CARDS; SOFTWARE ARCHITECTURE;

BLOCK WIEDEMANN; FINITE FIELDS; PARALLELISM; RANK; SPARSE MATRIX-VECTOR MULTIPLICATION;

COMPUTER ARCHITECTURE;

EID: 77956238872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1837210.1837224     Document Type: Conference Paper

References (21)

1. N. Bell and M. Garland. Implementing sparse matrix-vector multiplication on throughput-oriented processors. In SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pages 1-11, New York, NY, USA, 2009. ACM.
2. A. Buluc, J. T. Fineman, M. Frigo, J. R. Gilbert, and C. E. Leiserson. Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. In SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, pages 233-244, New York, NY, USA, 2009. ACM.
3. D. G. Cantor and E. Kaltofen. On fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28(7):693-701, 1991.
4. L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard. Efficient matrix preconditioners for black box linear algebra. Linear Algebra and its Applications, 343-344:119-146, 2002.
5. D. Coppersmith. Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Mathematics of Computation, 62(205):333-350, Jan. 1994.
6. J.-G. Dumas. Q-adic transform revisited. In D. Jeffrey, editor, Proceedings of the 2008 ACM International Symposium on Symbolic and Algebraic Computation, Hagenberg, Austria, pages 63-69. ACM Press, New York, July 2008.
7. J. G. Dumas, T. Gautier, and C. Pernet. Finite field linear algebra subroutines. In ISSAC '02: Proceedings of the 2002 international symposium on Symbolic and algebraic computation, pages 63-74, New York, NY, USA, 2002. ACM.
8. J.-G. Dumas, P. Giorgi, P. Elbaz-Vincent, and A. Urbanska. Parallel computation of the rank of large sparse matrices from algebraic k-tlieory. In S. Watt, editor, PASCO 2007, pages 43-52. Waterloo University, Ontario, Canada, July 2007.
9. J.-G. Dumas, P. Giorgi, and C. Pernet. Dense linear algebra over word-size prime fields: the FFLAS and FFPACK packages. ACM Trans. Math. Softw., 35(3):1-42, 2008.
10. J. v. Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, New York, NY, USA, 1999.
11. P. Giorgi, C.-P. Jeannerod, and G. Villard. On the complexity of polynomial matrix computations. In R. Sendra, editor, Proceedings of the 2003 ACM International Symposium on Symbolic and Algebraic Computation, Philadelphia, Pennsylvania, USA, pages 135-142. ACM Press, New York, Aug. 2003.
12. E. Kaltofen. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. Mathematics of Computation, 64(210):777-806, Apr. 1995.
13. E. Kaltofen and A. Lobo. Factoring high-degree polynomials by the black box Berlekamp algorithm. In ACM, editor, ISSAC '94: Proceedings of the 1994 International Symposium on Symbolic and Algebraic Computation: July 20-22, 1994, Oxford, England, United Kingdom, pages 90-98, pub-ACM:adr, 1994. ACM Press.
14. E. Kaltofen and B. D. Saunders. On Wiedemann's method of solving sparse linear systems. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC '91), volume 539 of Lecture Notes in Computer Science, pages 29-38, Oct. 1991.
15. W. J. Turner. A block Wiedemann rank algorithm. In J.-G. Dumas, editor, Proceedings of the 2006 ACM International Symposium, on Symbolic and Algebraic Computation, Genova, Italy, pages 332-339. ACM Press, New York, July 2006.
16. P. Tvrdik and I. Simecek. A new approach for accelerating the sparse matrix-vector multiplication. Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on, 0:156-163, 2006.
17. F. Vazquez, E. M. Garzon, J. A. Martinez, and J. J. Fernandez. The sparse matrix vector product on GPUs. Technical Report, June 2009.
18. G. Villard. A study of Coppersmith's block Wiedemann algorithm using matrix polynomials. Technical Report 975-IM, LMC/IMAG, Apr. 1997.
19. R. Vuduc, J. W. Demmel, and K. A. Yelick. Oski: A library of automatically tuned sparse matrix kernels. In Institute of Physics Publishing, 2005.
20. R. W. Vuduc and H.-J. Moon. Fast sparse matrix-vector multiplication by exploiting variable block structure. In L. T. Yang, O. F. Rana, B. D. Martino, and J. Dongarra, editors, HPCC, volume 3726 of Lecture Notes in Computer Science, pages 807-816, pub-SV:adr, 2005. Springer-Verlag Inc.
21. D. H. Wiedemann. Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory, 32(1):54-62, Jan. 1986.