Open AccessMemory Request Priority Based Warp Scheduling for GPUs
Author(s) -
Zhang Jun,
He Yanxiang,
Shen Fanfan,
Li Qing'an,
Tan Hai
Publication year - 2018
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2018.05.003
Subject(s) - computer science , locality , exploit , multithreading , parallel computing , general purpose computing on graphics processing units , locality of reference , scheduling (production processes) , performance improvement , thread (computing) , cache , graphics , operating system , philosophy , linguistics , computer security , operations management , economics
High performance of GPGPU comes from its super massive multithreading, which makes it more and more widely used especially in the field of throughputoriented. Data locality is one of the important factors affecting the performance of GPGPU. Although GPGPU can exploit intra/inter‐warp locality by itself in part, there is still large improvement space for that. In our work, we analyze the characteristics of different applications and propose memory request based warp scheduling to better exploit inter‐warp spatial locality. This method can make some warps with good inter‐warp locality run faster, which is beneficial to improve the whole performance. Our experimental results show that our proposed method can achieve 24.7% and 11.9% average performance improvement over LRR and MRPB respectively.