Exposing fine-grained parallelism in algebraic multigrid methods

SIAM Journal on Scientific Computing

Volumn 34, Issue 4, 2012, Pages

  Bell, Nathan ^a   Dalton, Steven ^b   Olson, Luke N ^b  

^a NVIDIA   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Algebraic multigrid; Graphics processing units; Iterative; Parallel; Sparse

Indexed keywords

ALGEBRA; COMPUTER GRAPHICS; DISTRIBUTED COMPUTER SYSTEMS; ITERATIVE METHODS; LINEAR SYSTEMS; PROGRAM PROCESSORS;

ALGEBRAIC MULTIGRID METHODS; ALGEBRAIC MULTIGRIDS; COARSE-GRAINED; COMPUTATIONAL SIMULATION; FINE-GRAINED PARALLELISM; ITERATIVE; LARGE SPARSE LINEAR SYSTEMS; PARALLEL; SPARSE; TRADITIONAL PROCESSING;

GRAPHICS PROCESSING UNIT;

EID: 84866417895     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/110838844     Document Type: Article

References (40)

1. M. ADAMS, M. BREZINA, J. HU, AND R. TUMINARO, Parallel multigrid smoothing: Polynomial versus Gauss-Seidel, J. Comput. Phys., 188 (2003), pp. 593-610.
2. A. H. BAKER, T. GAMBLIN, M. SCHULZ, AND U. M. YANG, Challenges of scaling algebraic multigrid across modern multicore architectures, in Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium, 2011.
3. R. E. BANK AND C. C. DOUGLAS, Sparse matrix multiplication package (SMMP), Adv. Comput. Math., 1 (1993), pp. 127-137.
4. M. M. BASKARAN AND R. BORDAWEKAR, Optimizing Sparse Matrix-Vector Multiplication on GPUs, Research report RC24704, IBM, 2009.
5. N. BELL AND M. GARLAND, Efficient Sparse Matrix-Vector Multiplication on CUDA, Technical report NVR-2008-004, NVIDIA Corporation, 2008.
6. N. BELL AND M. GARLAND, Implementing sparse matrix-vector multiplication on throughput-oriented processors, in Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, New York, ACM, 2009, pp. 18:1-18:11.
7. N. BELL AND M. GARLAND, CUSP: Generic Parallel Algorithms for Sparse Matrix and Graph Computations, http://code.google.com/p/cusp-library (2009).
8. G. E. BLELLOCH, Vector Models for Data-Parallel Computing, MIT Press, Cambridge, MA, 1990.
9. J. BOLZ, I. FARMER, E. GRINSPUN, AND P. SCHRÖODER, Sparse matrix solvers on the GPU: Conjugate gradients and multigrid, ACM Trans. Graph., 22 (2003), pp. 917-924.
10. E. CHOW, R. D. FALGOUT, J. J. HU, R. S. TUMINARO, AND U. M. YANG, A survey of parallelization techniques for multigrid solvers, Parallel Processing for Scientific Computing, SIAM, Philadelphia, 2006, pp. 179-202.
11. M. CHRISTEN, O. SCHENK, AND H. BURKHAR, General-purpose sparse matrix building blocks using the NVIDIA CUDA technology platform, in Proceedings of the First Workshop on General Purpose Processing on Graphics Processing Units, Northeastern University, Boston, MA, 2007.
12. A. J. CLEARY, R. D. FALGOUT, V. E. HENSON, J. E. JONES, T. A. MANTEUFFEL, S. F. MCCORMICK, G. N. MIRANDA, AND J. W. RUGE, Robustness and scalability of algebraic multigrid, SIAM J. Sci. Comput., 21 (2000), pp. 1886-1908.
13. J. M. COHEN AND M. J. MOLEMAKER, A fast double precision CFD code using CUDA, in Proceedings of the 21st International Conference on Parallel Computational Fluid Dynamics, 2009.
14. Cublas Library, Version 3.1, NVIDIA Corporation, 2010, http://developer.nvidia.com/cublas.
15. E. F. DAZEVEDO, M. R. FAHEY, AND R. T. MILLS, Vectorized sparse matrix multiply for compressed row storage format, in Proceedings of the International Conference on Computational Science, Springer, New York, 2005, pp. 99-106.
16. M. GARLAND AND D. B. KIRK, Understanding throughput-oriented architectures, Commun. ACM, 53 (2010), pp. 58-66.
17. M. W. GEE, C. M. SIEFERT, J. J. HU, R. S. TUMINARO, AND M. G. SALA, ML 5.0 Smoothed Aggregation User's Guide, Technical report SAND2006-2649, Sandia National Laboratories, Livermore, CA, 2006.
18. D. GÖDDEKE, R. STRZODKA, J. MOHD-YUSOF, P. S. MCCORMICK, H. WOBKER, C. BECKER, AND S. TUREK, Using GPUs to improve multigrid solver performance on a cluster, Int. J. Comput. Sci. Engrg., 4 (2008), pp. 36-55.
19. N. GOODNIGHT, G. LEWIN, D. LUEBKE, AND K. SKADRON, A multigrid solver for boundary value problems using programmable graphics hardware, in HWWS '03: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware, Aire-la-Ville, Switzerland, Eurographics Association, 2003, pp. 102-111.
20. F. G. GUSTAVSON, Two fast algorithms for sparse matrices: Multiplication and permuted transposition, ACM Trans. Math. Softw., 4 (1978), pp. 250-269.
21. G. HAASE, M. LIEBMANN, G. PLANK, AND C. DOUGLAS, Parallel algebraic multigrid on general purpose GPUS, in Proceedings of the 3rd Austrian Grid Symposium, J. Volkert et al., ed., 2010, pp. 28-37.
22. V. E. HENSON AND U. M. YANG, Boomerang: A parallel algebraic multigrid solver and precon-ditioner, Appl. Numer. Math., 41 (2002), pp. 155-177.
23. J. HOBEROCK AND N. BELL, Thrust: A Parallel Template Library, Version 1.4.0, 2011, http://thrust/github.com.
24. G. KARYPIS AND V. KUMAR, Parallel multilevel k-way partitioning scheme for irregular graphs, SIAM Rev., 41 (1999), pp. 278-300.
25. M. KAZHDAN AND H. HOPPE, Streaming multigrid for gradient-domain operations on large images, in Proceedings of SIGGRAPH '08, New York, ACM, 2008, pp. 21:1-21:10.
26. C. L. LAWSON, R. J. HANSON, D. R. KINCAID, AND F. T. KROGH, Basic linear algebra subprograms for Fortran usage, ACM Trans. Math. Software, 5 (1979), pp. 308-323.
27. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1055.
28. D. G. MERRILL AND A. S. GRIMSHAW, Revisiting Sorting for GPGNU Stream Architectures, Technical report CS2010-03, Department of Computer Science, University of Virginia, Charlottesville, VA, 2010.
29. D. MERRILL AND A. GRIMSHAW, Parallel Scan for Stream Architectures, Technical report CS2009-14, Department of Computer Science, University of Virginia, Charlottesville, VA, 2009.
30. NVIDIA CUDA Programming Guide, version 4.0, NVIDIA Corporation, 2011, http://developer.nvidia.com/cuda.
31. L. N. OLSON, J. SCHRODER, AND R. S. TUMINARO, A new perspective on strength measures in algebraic multigrid, Numer. Linear Algebra Appl., 17 (2010), pp. 713-733.
32. J. W. RUGE AND K. STÜBEN, Algebraic multigrid, in Multigrid Methods, Front. Appl. Math. 3, SIAM, Philadelphia, 1987, pp. 73-130.
33. S. SENGUPTA, M. HARRIS, Y. ZHANG, AND J. D. OWENS, Scan primitives for GPU computing, in Proceedings of Graphics Hardware 2007, ACM, 2007, pp. 97-106.
34. M. STÜRMER, H. KÖSTLER, AND U. RÜDE, How to optimize geometric multigrid methods on GPUS, in Proceedings of the 15th Copper Mountain Conference on Multigrid Methods, 2011.
35. R. S. TUMINARO AND C. TONG, Parallel smoothed aggregation multigrid: Aggregation strategies on massively parallel machines, in Proceedings of the Supercomp Conference, 2000, p. 5.
36. S. TZENG AND L.-Y. WEI, Parallel white noise generation on a GPU via cryptographic hash, in Proceedings of the 2008 Symposium on Interactive 3D Graphics and Games, ACM, 2008, pp. 79-87.
37. P. VANĚK, J. MANDEL, AND M. BREZINA, Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems, Computing, 56 (1996), pp. 179-196.
38. R. W. VUDUC AND H.-J. MOON, Fast sparse matrix-vector multiplication by exploiting variable block structure, in Proceedings of the High Performance Computing and Communications: First International Conference, HPCC 2005, Sorrento, Italy, 2005.
39. S. WILLIAMS, L. OLIKER, R. VUDUC, J. SHALF, K. YELICK, AND J. DEMMEL, Optimization of sparse matrix-vector multiplication on emerging multicore platforms, in Proceedings of the 2007 ACM/IEEE Conference on Supercomputing, 2007.
40. F. ZAFAR, M. OLANO, AND A. CURTIS, GPU random numbers via the tiny encryption algorithm, in Proceedings of the Conference on High Performance Graphics, Eurographics Association, 2010, pp. 133-141.