• DocumentCode
    3564271
  • Title

    Yet another proposal for all pair shortest path on GPU

  • Author

    Neelima, B. ; Prabhu, Rithesh G. ; Narayan, Anjjan S.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., NMAM Inst. of Technol., Udupi, India
  • fYear
    2014
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In present day applications, there has been a rapid increase in the amount of data to be processed and stored. Same set of operations will be performed on large data. With the help of GPU´s, these operations can be performed in parallel and reduce the computation time. Graph algorithms play an important role in our day to day applications. This paper reviews various implementation of All Pair Shortest Path algorithm (APSP). Further, this paper proposes a new method that can be used in increasing the efficiency of APSP on a GPU.
  • Keywords
    graph theory; graphics processing units; parallel processing; APSP; all pair shortest path GPU; computation time; graph algorithms; present day applications; Graphics processing units; Kernel; Tin; All pair shortest path; Graphics Processing Unit; Parallel computing; Single source shortest path;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Computing and Applications (ICHPCA), 2014 International Conference on
  • Print_ISBN
    978-1-4799-5957-0
  • Type

    conf

  • DOI
    10.1109/ICHPCA.2014.7045310
  • Filename
    7045310
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3564271