scholarly journals A Novel Cooperative Warp and Thread Block Scheduling Technique for Improving the GPGPU Resource Utilization

2017 ◽  
Vol 6 (5) ◽  
pp. 219-230 ◽  
Author(s):  
Do Cong Thuan ◽  
Yong Choi ◽  
Jong Myon Kim ◽  
Cheol Hong Kim
Keyword(s):  
Block Scheduling ◽  
Resource Utilization ◽  
Thread Block ◽  
Scheduling Technique

Coordinated thread block scheduling and warp scheduler for workload distribution

2020 ◽  
Vol 2 (2) ◽  
pp. 165-173
Author(s):  
Vo Viet Tan ◽  
Jihoon Lee ◽  
Pyungkoo Park
Keyword(s):  
Block Scheduling ◽  
Thread Block ◽  
Workload Distribution

scholarly journals Performance Analysis of Thread Block Schedulers in GPGPU and Its Implications

2020 ◽  
Vol 10 (24) ◽  
pp. 9121
Author(s):  
KyungWoon Cho ◽  
Hyokyung Bahn
Keyword(s):  
Block Scheduling ◽  
Modular Forms ◽  
Graphics Processing Unit ◽  
Round Robin ◽  
General Purpose ◽  
Processing Unit ◽  
Thread Block ◽  
Computing Unit ◽  
Specialized Hardware ◽  
Graphics Processing

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.

Improving GPGPU Performance via Cache Locality Aware Thread Block Scheduling

2017 ◽  
Vol 16 (2) ◽  
pp. 127-131 ◽  
Author(s):  
Li-Jhan Chen ◽  
Hsiang-Yun Cheng ◽  
Po-Han Wang ◽  
Chia-Lin Yang
Keyword(s):  
Block Scheduling ◽  
Thread Block

scholarly journals Inter-kernel Reuse-aware Thread Block Scheduling

2020 ◽  
Vol 17 (3) ◽  
pp. 1-27
Author(s):  
Muhammad Huzaifa ◽  
Johnathan Alsop ◽  
Abdulrahman Mahmoud ◽  
Giordano Salvador ◽  
Matthew D. Sinclair ◽  
...  
Keyword(s):  
Block Scheduling ◽  
Thread Block
Sign in / Sign up

Export Citation Format

Share Document