Adaptively scheduling parallel loops in distributed shared-memory systems

Yong Yan

doi:10.1109/71.569656

Adaptively scheduling parallel loops in distributed shared-memory systems

1997-01-01

38

PRE

AI

Y

Yong Yan *

张

张晓东 (Xiao‐Dong Zhang)

DOI：10.1109/71.569656

原文链接

原文求助

摘要

En 中文

Using runtime information of load distributions and processor affinity, we propose an adaptive scheduling algorithm and its variations from different control mechanisms. The proposed algorithm applies different degrees of aggressiveness to adjust loop scheduling granularities, aiming at improving the execution performance of parallel loops by making scheduling decisions that match the real workload distributions at runtime. We experimentally compared the performance of our algorithm and its variations with several existing scheduling algorithms on two parallel machines: the KSR-1 and the Convex Exemplar. The kernel application programs we used for performance evaluation were carefully selected for different classes of parallel loops. Our results show that using runtime information to adaptively adjust scheduling granularity is an effective way to handle loops with a wide range of load distributions when no prior knowledge of the execution can be used. The overhead caused by collecting runtime information is insignificant in comparison with the performance improvement. Our experiments show that the adaptive algorithm and its five variations outperformed the existing scheduling algorithms.

Keyword:

adaptive scheduling algorithms

dynamic information

load balancing

parallel loops

processor affinity

shared-memory systems

Adaptively scheduling parallel loops in distributed shared-memory systems

摘要

AI总结

期刊

机构

引用论文