Performance Analysis of Thread Block Schedulers in GPGPU and Its Implications

Applied Sciences

Hyokyung Bahn¹  KyungWoon Cho² 

[1] Department of Computer Engineering, Ewha University, Seoul 03760, Korea;Embedded Software Research Center, Ewha University, Seoul 03760, Korea;

关键词: thread block;    GPGPU;    thread block scheduling;    Round-Robin;   

DOI  :  10.3390/app10249121

来源: DOAJ

【 摘 要 】

GPGPU (General-Purpose Graphics Processing Unit) consists of hardware resources that can execute tens of thousands of threads simultaneously. However, in reality, the parallelism is limited as resource allocation is performed by the base unit called thread block, which is not managed judiciously in the current GPGPU systems. To schedule threads in GPGPU, a specialized hardware scheduler allocates thread blocks to the computing unit called SM (Stream Multiprocessors) in a Round-Robin manner. Although scheduling in hardware is simple and fast, we observe that the Round-Robin scheduling is not efficient in GPGPU, as it does not consider the workload characteristics of threads and the resource balance among SMs. In this article, we present a new thread block scheduling model that has the ability of analyzing and quantifying the performances of thread block scheduling. We implement our model as a GPGPU scheduling simulator and show that the conventional thread block scheduling provided in GPGPU hardware does not perform well as the workload becomes heavy. Specifically, we observe that the performance degradation of Round-Robin can be eliminated by adopting DFA (Depth First Allocation), which is simple but scalable. Moreover, as our simulator consists of modular forms based on the framework and we publicly open it for other researchers to use, various scheduling policies can be incorporated into our simulator for evaluating the performance of GPGPU schedulers.

【 授权许可】

Unknown