• DocumentCode
    3043272
  • Title

    Performance Impact Applying Compression Format to Sparse Matrix on Kernel Polynomial Method Using GPU

  • Author

    Zhang, Shixun ; Yamagiwa, Shinichi ; Okumura, Masahiko ; Yunoki, Seiji

  • Author_Institution
    Sch. of Inf., Kochi Univ. of Technol., Kochi, Japan
  • fYear
    2011
  • fDate
    Nov. 30 2011-Dec. 2 2011
  • Firstpage
    337
  • Lastpage
    341
  • Abstract
    Kernel Polynomial Method (KPM) is an efficient method used for simulations of crystal lattice system in research field of condensed matter physics and chemistry. KPM involves matrix operations such as matrix-vector multiplication in which the storage format of the matrix has a great impact not only on the performance of KPM but also the memory consumption. This paper proposes an implementation of the KPM on the recent graphics processing units (GPU) where the CRS format is applied to the matrix. This paper also illustrates performance evaluation of the implementation of GPU and that of CPU. We also compare performances among the cases with/without the CRS format in KPM. The evaluation shows that the GPU-based implementation achieves several times better performance than the CPU-based one.
  • Keywords
    chemistry computing; graphics processing units; mathematics computing; matrix multiplication; physics computing; polynomial matrices; sparse matrices; CRS format; chemistry; compression format; condensed matter physics; crystal lattice system simulations; graphics processing units; kernel polynomial method; matrix vector multiplication; performance evaluation; performance impact; sparse matrix; Computational modeling; Lattices; CRS; CUDA; Condensed Matter Physics; GPGPU; Kernel Polynomial Method;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking and Computing (ICNC), 2011 Second International Conference on
  • Conference_Location
    Osaka
  • Print_ISBN
    978-1-4577-1796-3
  • Type

    conf

  • DOI
    10.1109/ICNC.2011.65
  • Filename
    6131840