Search this article
Description
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),
Journal
-
- 法政大学大学院紀要. 理工学・工学研究科編
-
法政大学大学院紀要. 理工学・工学研究科編 58 1-5, 2017-03-31
法政大学大学院理工学・工学研究科
- Tweet
Details 詳細情報について
-
- CRID
- 1390572174784408320
-
- NII Article ID
- 120006357015
-
- NII Book ID
- AA12677220
-
- HANDLE
- 10114/13565
-
- ISSN
- 21879923
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- IRDB
- CiNii Articles
-
- Abstract License Flag
- Allowed