메뉴 건너뛰기




Volumn 46, Issue 8, 2011, Pages 267-276

Accelerating CUDA graph algorithms at maximum warp

Author keywords

CUDA; GPGPU; Parallel graph algorithms

Indexed keywords

BENCHMARK APPLICATIONS; COMPUTATIONAL DOMAINS; CUDA; DATA REPRESENTATIONS; GPGPU; GPU ALGORITHMS; GPU PROGRAMMING; GRAPH ALGORITHMS; GRAPH PROBLEMS; GRAPH STRUCTURES; MEMORY BANDWIDTHS; MULTITHREADED; PARALLEL GRAPH ALGORITHMS; PERFORMANCE GAIN; POOR PERFORMANCE; REAL-WORLD GRAPHS; REGULAR GRAPHS;

EID: 80053955412     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2038037.1941590     Document Type: Conference Paper
Times cited : (123)

References (25)
  • 2
    • 80053975663 scopus 로고    scopus 로고
    • http://en.wikipedia.org/wiki/GeForce-200-Series, 2010.
    • (2010)
  • 4
    • 33244482870 scopus 로고    scopus 로고
    • A computational study of external-memory bfs algorithms
    • D. Ajwani, R. Dementiev, and U. Meyer. A computational study of external-memory bfs algorithms. In ACM-SIAM SODA, 2006.
    • (2006) ACM-SIAM SODA
    • Ajwani, D.1    Dementiev, R.2    Meyer, U.3
  • 5
    • 79952783870 scopus 로고    scopus 로고
    • Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2
    • D. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2. In IEEE ICPP, 2006.
    • (2006) IEEE ICPP
    • Bader, D.1    Madduri, K.2
  • 6
    • 79952794548 scopus 로고    scopus 로고
    • Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks
    • D. Bader and K. Madduri. Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks. In IEEE IPDPS, 2008.
    • (2008) IEEE IPDPS
    • Bader, D.1    Madduri, K.2
  • 11
    • 32344433867 scopus 로고    scopus 로고
    • R-mat: A recursive model for graph mining
    • D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM, 2004.
    • (2004) SDM
    • Chakrabarti, D.1    Zhan, Y.2    Faloutsos, C.3
  • 13
    • 80053941100 scopus 로고    scopus 로고
    • Cray Inc. Cray xmt.
    • Cray, Inc. Cray xmt. http://www.cray.com/products/xmt/.
  • 15
    • 60649099910 scopus 로고    scopus 로고
    • Accelerating large graph algorithms on the gpu using cuda
    • P. Harish and P. J. Narayanan. Accelerating large graph algorithms on the gpu using cuda. In HiPC, 2007.
    • (2007) HiPC
    • Harish, P.1    Narayanan, P.J.2
  • 20
    • 77954976292 scopus 로고    scopus 로고
    • Dynamic warp subdivision for integrated branch and memory divergence tolerance
    • J. Meng, D. Tarjan, and K. Skadron. Dynamic warp subdivision for integrated branch and memory divergence tolerance. In ISCA, 2010.
    • (2010) ISCA
    • Meng, J.1    Tarjan, D.2    Skadron, K.3
  • 21
    • 77951154340 scopus 로고    scopus 로고
    • The gpu computing era
    • J. Nickolls and W. J. Dally. The gpu computing era. IEEE Micro, 30(2), 2010.
    • (2010) IEEE Micro , vol.30 , Issue.2
    • Nickolls, J.1    Dally, W.J.2
  • 22
    • 79952776779 scopus 로고    scopus 로고
    • A parallel externalmemory frontier breadth-first traversal algorithm for clusters of workstations
    • R. Niewiadomski, J. Amaral, and R. Holte. A parallel externalmemory frontier breadth-first traversal algorithm for clusters of workstations. In IEEE ICPP, 2006.
    • (2006) IEEE ICPP
    • Niewiadomski, R.1    Amaral, J.2    Holte, R.3
  • 23
    • 80053971905 scopus 로고    scopus 로고
    • Nvidia. Cuda.
    • Nvidia. Cuda. http://www.nvidia.com/cuda/.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.