Online Task Scheduling on Heterogeneous Clusters: An Experimental Study

Rosenvinge, Einar M. R.; Elster, Anne C.; Banino, Cyril

doi:10.1007/11558958_137

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Loop scheduling schemes for parallel and distributed systems have been proposed and studied in the past. For example, See ( [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22]) and references therein.…”

Section: Introductionmentioning

confidence: 99%

Multi-dimensional dynamic loop scheduling algorithms

Chronopoulos

Penmatsa

2007

2007 IEEE International Conference on Cluster Computing

View full text Add to dashboard Cite

Abstract-Distributed Computing Systems are a viable and less expensive alternative to parallel computers. However, a serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. Loop scheduling schemes for parallel computers and computer clusters have been proposed in the past. All these schemes are one-dimensional because they partition only the outermost loop of a nested loop construct. In this work, we consider scheduling nested loops with many dimensions. We propose a new methodology which partitions many levels (or dimensions) of nested loops. These new schemes show superior performance over the existing schemes. We implement our new schemes on a network of computers and make performance comparisons with other existing schemes. We expect the new schemes to be particularly useful for multi-core systems because of the fine granularity of the generated tasks.

show abstract