Fast and scalable list ranking on the GPU

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2009, Pages 235-243

  Rehman, M Suhail ^a   Kothapalli, Kishore ^a,b   Narayanan, P J ^a,c  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

^b Center for Security Theory and Algorithmic Research International   (India)

^c Center for Visual Information Technology   (India)

Author keywords

GPGPU; Irregular algorithm; List ranking; Many core; Parallel algorithm

Indexed keywords

BALANCED LOADS; CELL BROADBAND ENGINE; GENERAL PURPOSE PROGRAMMING; GRAPHICS PROCESSING UNIT; IRREGULAR ALGORITHM; LIST RANKING; MANY-CORE; MEMORY ACCESS; MULTITHREADED; MULTITHREADED ARCHITECTURE; PARALLEL COMPUTING; PRACTICAL ISSUES;

COMPUTER GRAPHICS EQUIPMENT; INTELLIGENT CONTROL; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS;

PARALLEL ALGORITHMS;

EID: 70449700267     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542275.1542311     Document Type: Conference Paper

References (21)

1. R. J. Anderson and G. L. Miller. A Simple Randomized Parallel Algorithm for List-Ranking. Information Processing Letters, 33(5):269-273, 1990.
2. D. Bader, G. Cong, and J. Feo. On the Architectural Requirements for Efficient Execution of Graph Algorithms. International Conference on Parallel Processing (ICPP), 2005, pages 547-556, June 2005.
3. D. A. Bader, V. Agarwal, and K. Madduri. On the Design and Analysis of Irregular Algorithms on the Cell Processor: A Case Study of List Ranking. In 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 1-10. IEEE, 2007.
4. D. A. Bader and G. Cong. A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs). Journal of Parallel and Distributed Computing, 65(9):994-1006, 2005.
5. D. A. Bader, S. Sreshta, and N. R. Weisse-Bernstein. Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs). In HiPC '02: Proceedings of the 9th International Conference on High Performance Computing, Lecture Notes in Computer Science, pages 63-78, London, UK, 2002. Springer-Verlag.
6. I. Buck. GPU Computing with NVIDIA CUDA. In SIGGRAPH '07: ACM SIGGRAPH 2007 courses, page 6, New York, NY, USA, 2007. ACM.
7. R. Cole and U. Vishkin. Faster Optimal Parallel Prefix Sums and List Ranking. Information and Computation, 81(3):334-352, 1989.
8. Y. Dotsenko, N. Govindaraju, P. Sloan, C. Boyd, and J. Manferdelli. Fast Scan Algorithms on Graphics Processors. In Proceedings of the 22nd Annual International Conference on Supercomputing (ICS), pages 205-213. ACM New York, NY, USA, 2008.
9. N. Govindaraju and D. Manocha. Cache-Efficient Numerical Algorithms using Graphics Hardware. Parallel Computing, 33(10-11):663-684, 2007.
10. N. K. Govindaraju, S. Larsen, J. Gray, and D. Manocha. A Memory Model for Scientific Algorithms on Graphics Processors. In SC '06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing, page 89, New York, NY, USA, 2006. ACM.
11. M. Harris, J. Owens, S. Sengupta, Y. Zhang, and A. Davidson. CUDPP: CUDA Data Parallel Primitives Library. http://gpgpu.org/developer/cudpp.
12. D. R. Helman and J. JáJá. Designing Practical Efficient Algorithms for Symmetric Multiprocessors. In ALENEX '99: Selected papers from the International Workshop on Algorithm Engineering and Experimentation, Lecture Notes in Computer Science, pages 37-56. Springer-Verlag, 1999.
13. J. JáJá. An Introduction to Parallel Algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1992.
14. G. L. Miller and J. H. Reif. Parallel Tree Contraction and its Application. pages 478-489, Oct. 1985.
15. A. Munshi. OpenCL Specification V1.0. Technical report, Khronos OpenCL Working Group, 2008.
16. NVIDIA Corporation. CUDA: Compute Unified Device Architecture Programming Guide. Technical report, NVIDIA, 2007.
17. M. Reid-Miller. List Ranking and List Scan on the Cray C-90. In SPAA '94: Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 104-113, New York, NY, USA, 1994. ACM.
18. S. Ryoo, C. Rodrigues, S. Stone, S. Baghsorkhi, S. Ueng, J. Stratton, and W. Wen-mei. Program Optimization Space Pruning for a Multithreaded GPU. In Proceedings of the Sixth Annual IEEE/ACM International Symposium on Code Generation and Optimization, pages 195-204. ACM New York, NY, USA, 2008.
19. S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens. Scan Primitives for GPU Computing. In GH '07: Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware, pages 97-106, Switzerland, 2007. Eurographics Association.
20. J. Sibeyn. Minimizing Global Communication in Parallel List Ranking. In Euro-Par Parallel Processing, Lecture Notes in Computer Science, pages 894-902. Springer, 2003.
21. J. C. Wyllie. The Complexity of Parallel Computations. PhD thesis, Cornell University, Ithaca, NY, USA, 1979.