GPU を用いたマルチスレッドアルゴリズムの 効率的な実現に関する一考察

DOI HANDLE

この論文をさがす

抄録

A GPU is generally an arithmetic unit specializing in image processing. Although its function is limited as compared with CPU, a large amount of data can be simultaneously and concurrently processed by a plurality of processors. In recent years, attention has been drawn to GPGPU which makes use of this GPU function not only for image processing but also its processing capability for high performance computing. In this thesis, we can consider efficient implementation of multithread algorithms by using Dynamic Parallelism in GPU. We give efficient algorithms to Fibonacci sequence and Tower of Hanoi. In particular, our algorithm for Tower of Hanoi is better than previous algorithm. Key Words : GPGPU, multi-thread algorithm, Dynamic Parallelism(DP),

収録刊行物

詳細情報 詳細情報について

  • CRID
    1390572174784408320
  • NII論文ID
    120006357015
  • NII書誌ID
    AA12677220
  • DOI
    10.15002/00014209
  • HANDLE
    10114/13565
  • ISSN
    21879923
  • 本文言語コード
    ja
  • データソース種別
    • JaLC
    • IRDB
    • CiNii Articles
  • 抄録ライセンスフラグ
    使用可

問題の指摘

ページトップへ