BFS-4K: An Efficient Implementation of BFS for Kepler GPU Architectures

IEEE Transactions on Parallel and Distributed Systems

Volumn 26, Issue 7, 2015, Pages 1826-1838

  Busato, Federico ^a   Bombieri, Nicola ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

BFS; CUDA; GPU; Kepler; Parallel graph algorithms

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; PROGRAM PROCESSORS;

BFS; CUDA; GPU; KEPLER; PARALLEL GRAPH ALGORITHMS;

COMPUTER ARCHITECTURE;

EID: 84933576518     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2014.2330597     Document Type: Article

References (30)

1. J.-D. Cho, S. Raje, and M. Sarrafzadeh, "Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for vlsi applications," IEEE Trans. Comput., vol. 47, no. 11, pp. 1253-1266, Nov. 1998.
2. T. Lengauer and R. E. Tarjan, "A fast algorithm for finding dominators in a flowgraph," ACM Trans. Program. Language Syst., vol. 1, no. 1, pp. 121-141, Jan. 1979.
3. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. Cambridge, MA, USA: MIT Press, 2009.
4. P. Harish and P. J. Narayanan, "Accelerating large graph algorithms on the GPU using cuda," in Proc. 14th Int. Conf. High Perform. Comput., 2007, pp. 197-208.
5. S. Hong, S. K. Kim, T. Oguntebi, and K. Olukotun, "Accelerating cuda graph algorithms at maximum warp," in Proc. 16th ACM Symp. Principles Pract. Parallel Programming, 2011, pp. 267-276.
6. S. M. Yangdong Deng and B. D. Wang, "Taming irregular EDA applications on GPUs," in Proc. IEEE Int. Conf. Comput.-Aided Des., 2009, pp. 539-546.
7. Y. Jia, V. Lu, J. Hoberock, M. Garland, and J. C. Hart, "Edge v. node parallelism for graph centrality metrics," GPU Computing Gems Jade Edition. San Mateo, CA, USA: Morgan Kaufmann, 2011, ch. 11.
8. G. Singla, A. Tiwari, and D. P. Singh, "New approach for graph algorithms on GPU using CUDA," Int. J. Comput. Appl., vol. 72, pp. 38-42, 2013.
9. V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader, "Scalable graph exploration on multicore processors," in Proc. ACM/IEEE Int. Conf. High Perform. Comput., Netw., Storage Anal., 2010, pp. 1-11.
10. C. E. Leiserson and T. B. Schardl, "A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)," in Proc. 22nd ACM Symp. Parallelism Algorithms Archit., 2010, pp. 303-314.
11. Y. Xia and V. K. Prasanna, "Topologically adaptive parallel breadth-first search on multicore processors," in Proc. 21st Int. Conf. Parallel Distrib. Comput. Syst., 2009, pp. 91-97.
12. D. P. Scarpazza, O. Villa, and F. Petrini, "Efficient breadth-first search on the cell/BE processor," IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 10, pp. 1381-1395, Oct. 2008.
13. NVIDIA, Kepler gk110. (2014). [Online]. Available: www.nvidia.com/content/PDF/kepler/NV-DS-Tesla-KCompute-Arch-May-2012-LR.pdf
14. NVIDIA, Cuda home page. (2014). [Online]. Available: http://www.nvidia.co.uk/object/cuda-parallel-computing-uk.html
15. L. Luo, M. Wong, and W.-m. Hwu, "An effective GPU implementation of breadth-first search," in Proc. 47th Des. Autom. Conf., 2010, pp. 52-55.
16. D. Merrill, M. Garland, and A. Grimshaw, "Scalable GPU graph traversal," in Proc. 17th ACM SIGPLAN Symp. Principles Pract. Parallel Programming, 2012, pp. 117-128.
17. S. Xiao and W. Chun Feng, "Inter-block GPU communication via fast barrier synchronization," in Proc. of IEEE Int. Symp. Parallel Distrib. Process., 2012, pp. 1-12.
18. G. E. Blelloch, "Prefix sums and their applications," School Comput. Sci., Carnegie Mellon University, Pittsburgh, PA USA, Tech. Rep. CMU-CS-90-190, 1990.
19. G. E. Blelloch, "Scans as primitive parallel operations," IEEE Trans. Comput., vol. 38, no. 11, pp. 1526-1538, Nov. 1989.
20. S. Chatterjee, G. E. Blelloch, and M. Zagha, "Scan primitives for vector computers," in Proc. ACM/IEEE Conf. Supercomput., 1990, pp. 666-675.
21. M. Billeter, O. Olsson, and U. Assarsson, "Efficient stream compaction on wide SIMD many-core architectures," in Proc. Conf. High Perform. Graph., 2009, pp. 159-166.
22. Y. Dotsenko, N. K. Govindaraju, P.-P. Sloan, C. Boyd, and J. Manferdelli, "Fast scan algorithms on graphics processors," in Proc. 22nd Annu. Int. Conf. Supercomput., 2008, pp. 205-213.
23. D. Merril and A. Grimshaw, "Parallel scan for stream architectures," Dept. Comput. Sci., Univ. Virginia, Blacksburg, VA, USA, Tech. Rep. CS-200914, 2009.
24. S. Sengupta, M. Harris, and M. Garland, "Efficient parallel scan algorithms for GPUs," NVIDIA, Santa Clara, CA, USA, Tech. Rep. NVR-2008-003, 2009.
25. M. Harris and M. Garland, GPU Computing Gems Emerald Edition: Optimizing Parallel Prefix Operations for the Fermi Architecture. Reading, MA, USA: Addison Wesley, 2008, ch. 3.
26. Stanford Network Analysis Platform, Stanford University. (2013) [Online]. Available: http://snap.stanford.edu/data/index.html
27. 10th DIMACS Implementation Challenge. (2014). [Online]. Available: http://www.cc.gatech.edu/dimacs10/index.shtml
28. GTgraph: A suite of synthetic random graph generators. (2014). [Online]. Available: http://www.cse.psu.edu/madduri/software/GTgraph/
29. NVIDIA GEFORCE GTX780. (2014). [Online]. Available: http://www.nvidia.com/gtx-700-graphics-cards/gtx-780/
30. Wolfram Mathematica 9, Pseudo diameter. (2012) [Online]. Available: http://reference.wolfram.com/mathematica/GraphUtilities/ref/PseudoDiameter.html