DocumentCode :
694667
Title :
Partition Strategies for C Source Programs to Support CPU+GPU Coordination Computing
Author :
Ding Yao ; Guosun Zeng ; Chunling Ding
Author_Institution :
Dept. of Comput. Sci. & Technol., Tongji Univ., Shanghai, China
fYear :
2013
fDate :
7-8 Dec. 2013
Firstpage :
39
Lastpage :
48
Abstract :
GPGPU technology provides a new effective way for achieving high performance heterogeneous computing. However, how to restructure traditional programs is the key to use GPGPU technology under CPU+GPU heterogeneous environment. This paper studies the partition strategies for C source programs to support CPU+GPU coordination computing. By analyzing characteristics of c source programs in memory access, arithmetic density, control flow structure and data parallelism, while considering the difference between CPU and GPU hardware, some strategies and algorithms for partitioning the target programs are presented. Finally, some experiments are conducted by using some typical programs to verify the effectiveness of proposed strategies and algorithms.
Keywords :
graphics processing units; parallel programming; C source programs; CPU-GPU coordination computing; arithmetic density; central processing unit; control flow structure; data parallelism; graphics processing unit; high performance heterogeneous computing; memory access; partition strategy; Computational modeling; Graphics processing units; Hardware; Instruction sets; Parallel processing; Partitioning algorithms; Pipelines; C source programs; GPGPU; coordination computing; partition strategies;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Science and Cloud Computing (ISCC), 2013 International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
978-1-4799-4968-7
Type :
conf
DOI :
10.1109/ISCC.2013.23
Filename :
6972559
Link To Document :
بازگشت