Overcoming the Memory Hierarchy Inefficiencies in Graph Processing Applications

Author(s):  
Jilan Lin ◽  
Shuangchen Li ◽  
Yufei Ding ◽  
Yuan Xie
2019 ◽  
Vol 68 (8) ◽  
pp. 1131-1146 ◽  
Author(s):  
Guohao Dai ◽  
Tianhao Huang ◽  
Yu Wang ◽  
Huazhong Yang ◽  
John Wawrzynek

2018 ◽  
Vol 175 ◽  
pp. 02009
Author(s):  
Carleton DeTar ◽  
Steven Gottlieb ◽  
Ruizi Li ◽  
Doug Toussaint

With recent developments in parallel supercomputing architecture, many core, multi-core, and GPU processors are now commonplace, resulting in more levels of parallelism, memory hierarchy, and programming complexity. It has been necessary to adapt the MILC code to these new processors starting with NVIDIA GPUs, and more recently, the Intel Xeon Phi processors. We report on our efforts to port and optimize our code for the Intel Knights Landing architecture. We consider performance of the MILC code with MPI and OpenMP, and optimizations with QOPQDP and QPhiX. For the latter approach, we concentrate on the staggered conjugate gradient and gauge force. We also consider performance on recent NVIDIA GPUs using the QUDA library.


1995 ◽  
Vol 23 (3) ◽  
pp. 28
Author(s):  
Daniel Tabak
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document