The impact of parallel loop scheduling strategies on prefetching in a shared memory multiprocessor

1994 ◽  
Vol 5 (6) ◽  
pp. 573-584 ◽  
Author(s):  
D.J. Lilja
1987 ◽  
Vol 5 (1-2) ◽  
pp. 211-217 ◽  
Author(s):  
Merrell L Patrick ◽  
Daniel A Reed ◽  
Robert G Voigt

2005 ◽  
Vol 15 (01n02) ◽  
pp. 131-152 ◽  
Author(s):  
JOSE AGUILAR ◽  
ERNST LEISS

In this paper, we propose different approaches for the parallel loop scheduling problem on distributed as well as shared memory systems. Specifically, we propose adaptive loop scheduling models in order to achieve load balancing, low runtime scheduling, low synchronization overhead and low communication overhead. Our models are based on an adaptive determination of the chunk size and an exploitation of the processor affinity property, and consider different situations (central or local queues, and dynamic or static loop partition).


1993 ◽  
Vol 23 (1) ◽  
pp. 159-162
Author(s):  
David R. Cheriton ◽  
Hendrik A. Goosen ◽  
Hugh Holbrook ◽  
Philip Machanick

2015 ◽  
Vol 19 (2) ◽  
pp. 135-152 ◽  
Author(s):  
Antonio Fernández Anta ◽  
Chryssis Georgiou ◽  
Dariusz R. Kowalski ◽  
Joerg Widmer ◽  
Elli Zavou

Sign in / Sign up

Export Citation Format

Share Document