Safe self-scheduling: A parallel loop scheduling scheme for shared-memory multiprocessors

1994 ◽  
Vol 22 (6) ◽  
pp. 589-616 ◽  
Author(s):  
Jie Liu ◽  
Vikram A. Saletore ◽  
Ted G. Lewis
Keyword(s):  
Shared Memory ◽  
Loop Scheduling ◽  
Shared Memory Multiprocessors ◽  
Parallel Loop ◽  
Scheduling Scheme

PARALLEL LOOP SCHEDULING APPROACHES FOR DISTRIBUTED AND SHARED MEMORY SYSTEMS

2005 ◽  
Vol 15 (01n02) ◽  
pp. 131-152 ◽  
Author(s):  
JOSE AGUILAR ◽  
ERNST LEISS
Keyword(s):  
Shared Memory ◽  
Memory Systems ◽  
Communication Overhead ◽  
Scheduling Problem ◽  
Loop Scheduling ◽  
Parallel Loop ◽  
Chunk Size ◽  
Synchronization Overhead ◽  
Scheduling Models

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).

Benefits of cache-affinity scheduling in shared-memory multiprocessors

1993 ◽  
Vol 21 (1) ◽  
pp. 272-274 ◽  
Author(s):  
Josep Torrellas ◽  
Andrew Tucker ◽  
Anoop Gupta
Keyword(s):  
Shared Memory ◽  
Shared Memory Multiprocessors ◽  
Cache Affinity
Sign in / Sign up

Export Citation Format

Share Document