An execution strategy and optimized runtime support for parallelizing irregular reductions on modern GPUs

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2011, Pages 2-11

  Huo, Xin ^a   Ravi, Vignesh ^a   Ma, Wenjing ^a   Agrawal, Gagan ^a  

^a Ohio State University   (United States)

Author keywords

cuda; gpu; irregular reduction; partitioning

Indexed keywords

CACHE PERFORMANCE; CUDA; DATA ACCESS; DISTRIBUTED MEMORY MACHINES; DISTRIBUTED SHARED MEMORY; ENGINEERING CODES; EXECUTION STRATEGIES; GPU; HIGH PERFORMANCE COMPUTING; IRREGULAR REDUCTIONS; NUMBER OF THREADS; PARALLELIZATIONS; PARALLELIZING; PARTITIONING; PARTITIONING METHODS; RUNTIME MODULES; RUNTIME SUPPORT; RUNTIMES; SHARED MEMORIES; SHARED MEMORY MACHINES; SYSTEMATIC STUDY; UNIPROCESSORS; UNSTRUCTURED GRID;

CACHE MEMORY; COMPUTER SOFTWARE SELECTION AND EVALUATION; INTELLIGENT CONTROL; OPTIMIZATION;

PROGRAM PROCESSORS;

EID: 79959575872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1995896.1995900     Document Type: Conference Paper

References (40)

1. G. Agrawal and J. Saltz. Interprocedural data flow based optimizations for distributed memory compilation. Software Practice and Experience, 27(5):519-546, May 1997.
2. S. Baghsorkhi, M. Lathara, and W. mei Hwu. CUDA-lite: Reducing GPU Programming Complexity. In LCPC 2008, 2008.
3. M. M. Baskaran, U. Bondhugula, S. Krishnamoorthy, J. Ramanujam, A. Rountev, and P. Sadayappan. Automatic data movement and computation mapping for multi-level parallel architectures with explicitly managed memories. In PPoPP, pages 1-10, NY, USA, 2008. ACM.
4. W. Blume, R. Doallo, R. Eigenman, J. Grout, J. Hoelflinger, T. Lawrence, J. Lee, D. Padua, Y. Paek, B. Pottenger, L. Rauchwerger, and P. Tu. Parallel programming with Polaris. IEEE Computer, 29(12):78-82, Dec. 1996.
5. J. W. Choi, A. Singh, and R. W. Vuduc. Model-driven Autotuning of Sparse Matrix-vector Multiply on GPUs. In PPoPP, Feb. 2010.
6. A. Corrigan, F. Camelli, R. Löhner, and J. Wallin. Running unstructured grid cfd solvers on modern graphics hardware. In 19th AIAA Computational Fluid Dynamics Conference, number AIAA 2009-4001, June 2009.
7. R. Das, , P. Havlak, J. Saltz, and K. Kennedy. Index array flattening through program transformation. In SC95. IEEE Computer Society Press, Dec. 1995.
8. R. Das, D. J. Mavriplis, J. Saltz, S. Gupta, and R. Ponnusamy. The design and implementation of a parallel unstructured Euler solver using software primitives. AIAA Journal, 32(3):489-496, Mar. 1994.
9. C. Ding and K. Kennedy. Improving cache performance of dynamic applications with computation and data layout transformations. In PLDI99, May 1999.
10. M. S. Friedrichs, P. Eastman, V. Vaidyanathan, M. Houston, S. Legrand, A. L. Beberg, D. L. Ensign, C. M. Bruns, and V. S. Pande. Accelerating molecular dynamic simulation on graphics processing units. Journal of Computational Chemistry, 30(Radeon 4870):864-872, 2009.
11. M. Garland. Sparse matrix computations on manycore GPUs. In DAC, 2008.
12. E. Gutierrez, O. Plata, and E. L. Zapata. A compiler method for the parallel execution of irregular reductions in scalable shared memory multiprocessors. In ICS00, pages 78-87. ACM Press, May 2000.
13. M. Hall, S. Amarsinghe, B. Murphy, S. Liao, and M. Lam. Maximizing multiprocessor performance with the SUIF compiler. IEEE Computer, (12), Dec. 1996.
14. H. Han and C.-W. Tseng. Improving compiler and runtime support for irregular reductions. In LCPC98, Aug. 1998.
15. H. Han and C.-W. Tseng. A comparison of locality transformations for irregular codes. In Proceedings of Fifth Workshop on Languages, Compilers, and Runtime Systems for Scalable Computers, pages 31-36, May 2000.
16. R. v. Hanxleden. Handling irregular problems with Fortran D - a preliminary report. In CPC, Delft, The Netherlands, Dec. 1993. Also available as CRPC Technical Report CRPC-TR93339-S.
17. Y.-S. Hwang, R. Das, J. H. Saltz, M. Hodoscek, and B. R. Brooks. Parallelizing molecular dynamics programs for distributed memory machines. IEEE Computational Science & Engineering, 2(2):18-29, Summer 1995. Also available as University of Maryland Technical Report CS-TR-3374 and UMIACS-TR-94-125.
18. M. Kaddoura, C.-W. Ou, and S. Ranka. Partitioning unstructured computational graphs for nonuniform and adaptive environments. IEEE Parallel & Distributed Technology, 3(3):63-69, Fall 1995.
19. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291-307, Feb. 1970.
20. M. Khan, G. Rudy, C. Chen, M. Hall, and J. Chame. Using Compiler-Based Autotuning to Generate High-Performance GPU Libraries. SC 2010 Poster Session, 2010.
21. C. Koelbel and P. Mehrotra. Compiling global name-space parallel loops for distributed execution. TPDS, 2(4):440-451, Oct. 1991. (Pubitemid 23624758)
22. A. Lain and P. Banerjee. Exploiting spatial regularity in irregular iterative applications. In IPPS95, pages 820-826. IEEE Computer Society Press, Apr. 1995.
23. S. Lee and R. Eigenmann. OpenMPC: Extended OpenMP Programming and Tuning for GPUs. In SC, Nov 2010.
24. S. Lee, S.-J. Min, and R. Eigenmann. OpenMP to GPGPU: A Compiler Framework for Automatic Translation and Optimization. In PPoPP'09, 2009.
25. Y. Lin and D. Padua. On the automatic parallelization of sparse and irregular Fortran programs. In Proceedings of the Workshop on Languages, Compilers, and Runtime Systems for Scalable Computers (LCR - 98), May 1998.
26. W. Liu, B. Schmidt, G. Voss, and W. Müller-Wittig. Molecular dynamics simulations on commodity gpus with cuda. In HiPC, pages 185-196, 2007.
27. W. Ma and G. Agrawal. A Translation System for Enabling Data Mining Applications on GPUs. In ICS, June 2009.
28. W. Ma and G. Agrawal. An Integer Programming Framework for Optimizing Shared Memory Use on GPUs. In HiPC, Dec. 2010.
29. J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving memory hierarchy performance of irregular applications. In ICS, June 1999.
30. N. Mitchell, L. Carter, and J. Ferrante. Localizing non-affine array references. In PACT, Oct. 1999.
31. M. Moazeni, A. Bui, and M. Sarrafzadeh. A Memory Optimization Technique for Software-Managed Scratchpad Memory in GPUs. http://www.sasp-conference.org/ index.html, Jul 2009.
32. S. Mukherjee, S. Sharma, M. Hill, J. Larus, A. Rogers, and J. Saltz. Efficient support for irregular applications on distributed-memory machines. In PPOPP, pages 68-79. ACM Press, July 1995.
33. ACM SIGPLAN Notices, Vol. 30, No. 8.
34. R. Ponnusamy, J. Saltz, A. Choudhary, Y.-S. Hwang, and G. Fox. Runtime support and compilation methods for user-specified irregular data distributions. TPDS, 6(8):815-831, Aug. 1995.
35. K. Schloegel, G. Karypis, and V. Kumar. Parallel static and dynamic multi-constraint graph partitioning. Concurrency and Computation: Practice and Experience, 14(3):219-240, 2002. (Pubitemid 34460007)
36. N. Sundaram, A. Raghunathan, and S. Chakradhar. A framework for efficient and scalable execution of domain-specific templates on GPUs. In IPDPS, 2009.
37. J. P. Walters, V. Balu, V. Chaudhary, D. Kofke, and A. Schultz. Accelerating molecular dynamics simulations with gpus. In ISCA PDCCS, pages 44-49, 2008.
38. J. Wu, R. Das, J. Saltz, H. Berryman, and S. Hiranandani. Distributed memory compiler design for sparse problems. IEEE Transactions on Computers, 44(6):737-753, June 1995.
39. Y. Yang, P. Xiang, J. Kong, and H. Zhou. A GPGPU compiler for memory optimization and parallelism management. In PLDI, 2010.
40. H. Yu and L. Rauchwerger. Adaptive reduction parallelization techniques. In ICS00, pages 66-75. ACM Press, May 2000.