Proceedings of ISP RAS


On-line algorithm for scheduling parallel tasks on a group of related clusters.

S.N. Zhuk.

Abstract

A classical problem of scheduling the set of tasks optimizing load balancing for a set of given processors was considered in theory in 1966. Graham's algorithm sending each task to a least loaded machine (processor) was the first example of approximate algorithm with guaranteed constant approximation quality. But all tasks and processors (machines) in Graham's example were simple (only one processor was sufficient for each task). On the other hand Graham's algorithm was an on-line one that is each task was sended to processor without knowing future tasks. With wide use of computational clusters very actual became the problem of scheduling parallel tasks on the set of parallel clusters in the class of on-line algorithms.. This problem has very close relation to a two dimensional packing problem, socalled multiple strip packing problem. Few years ago the author proposed an on-line algorithm for this problem and proved that for arbitrary set of parallel tasks (rectangles) the obtained schedule (packing) is within 2e of the optimal. In this paper the author generalized his on-line algorithm for the case of related parallel machines when all clusters have different speeds of processors in different clusters. An on-line algorithm for scheduling parallel tasks on a group of clusters with different speeds of processors is presented and it was proved that its approximation ratio is 2e for any set of parallel tasks. This result is non-trivial because even the case of one-processor related machines was intensively investigated and some algorithms with constant approximation ratio were presented.

Keywords

parallel computations, load balancing, scheduling parallel tasks on related clusters

Edition

Proceedings of the Institute for System Programming, vol. 23, 2012, pp. 447-454.

ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).

DOI: 10.15514/ISPRAS-2012-23-27

Full text of the paper in pdf (in Russian) Back to the contents of the volume