http://iet.metastore.ingenta.com
1887

Memory Request Priority Based Warp Scheduling for GPUs

Memory Request Priority Based Warp Scheduling for GPUs

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Chinese Journal of Electronics — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

http://iet.metastore.ingenta.com/content/journals/10.1049/cje.2018.05.003
Loading

Related content

content/journals/10.1049/cje.2018.05.003
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address