scholarly journals NUMA-aware scheduling and memory allocation for data-flow task-parallel applications

2016 ◽  
Vol 51 (8) ◽  
pp. 1-2
Author(s):  
Andi Drebes ◽  
Antoniu Pop ◽  
Karine Heydemann ◽  
Nathalie Drach ◽  
Albert Cohen
Author(s):  
Jing Chen ◽  
Pirah Noor Soomro ◽  
Mustafa Abduljabbar ◽  
Madhavan Manivannan ◽  
Miquel Pericas

2013 ◽  
Vol 21 (3-4) ◽  
pp. 123-136 ◽  
Author(s):  
Stephen L. Olivier ◽  
Bronis R. de Supinski ◽  
Martin Schulz ◽  
Jan F. Prins

Task parallelism raises the level of abstraction in shared memory parallel programming to simplify the development of complex applications. However, task parallel applications can exhibit poor performance due to thread idleness, scheduling overheads, andwork time inflation– additional time spent by threads in a multithreaded computation beyond the time required to perform the same work in a sequential computation. We identify the contributions of each factor to lost efficiency in various task parallel OpenMP applications and diagnose the causes of work time inflation in those applications. Increased data access latency can cause significant work time inflation in NUMA systems. Our locality framework for task parallel OpenMP programs mitigates this cause of work time inflation. Our extensions to the Qthreads library demonstrate that locality-aware scheduling can improve performance up to 3X compared to the Intel OpenMP task scheduler.


2009 ◽  
Vol 180 ◽  
pp. 012046 ◽  
Author(s):  
Michael Wilde ◽  
Ioan Raicu ◽  
Allan Espinosa ◽  
Zhao Zhang ◽  
Ben Clifford ◽  
...  

2012 ◽  
Vol 22 (02) ◽  
pp. 1240006 ◽  
Author(s):  
M. ALDINUCCI ◽  
M. DANELUTTO ◽  
P. KILPATRICK ◽  
M. TORQUATI

We propose a data flow based run time system as an efficient tool for supporting execution of parallel code on heterogeneous architectures hosting both multicore CPUs and GPUs. We discuss how the proposed run time system may be the target of both structured parallel applications developed using algorithmic skeletons/parallel design patterns and also more "domain specific" programming models. Experimental results demonstrating the feasibility of the approach are presented.


2008 ◽  
Vol 24 (5) ◽  
pp. 354-370 ◽  
Author(s):  
Sven Schulz ◽  
Wolfgang Blochinger ◽  
Markus Held ◽  
Clemens Dangelmayr

Sign in / Sign up

Export Citation Format

Share Document