• DocumentCode
    1834161
  • Title

    Implementation of graph algorithms over GPU: A comparative analysis

  • Author

    Dashora, Swarish ; Khare, Nilay

  • Author_Institution
    Dept. of Comput. Sci. Eng. & Inf. Technol., Maulana Azad Nat. Inst. of Technol., Bhopal, India
  • fYear
    2012
  • fDate
    1-2 March 2012
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    GPU (Graphics Processing Unit) provides high computational speed at a very low cost as compared to high end systems. The field of parallel processing using GPU is advancing very fast with a new technology being introduced in the field every day. With such advancements, it is necessary to review the major works done in this field. Graph traversal is one of the major challenges in this field. So far comprehensive review work covering major areas of the graph traversal techniques have not been reported much. This paper aims at surveying the implementation of different graph traversal techniques (viz. BFS, SSSP, APSP) using CUDA architecture and GPU.
  • Keywords
    graph theory; graphics processing units; parallel processing; GPU; comparative analysis; graph algorithm implementation; graph traversal techniques; graphics processing unit; high computational speed; parallel processing; Arrays; Graphics processing unit; Instruction sets; Kernel; Partitioning algorithms; Programming; CUDA; GPU; Graph Algorithms; Parallel Processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrical, Electronics and Computer Science (SCEECS), 2012 IEEE Students' Conference on
  • Conference_Location
    Bhopal
  • Print_ISBN
    978-1-4673-1516-6
  • Type

    conf

  • DOI
    10.1109/SCEECS.2012.6184824
  • Filename
    6184824