Discrete Mathematics & Theoretical Computer Science


Volume 3 n° 4 (1999), pp. 155-166

author:Keqin Li
title:Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks
keywords:Approximation algorithm, Average-case performance ratio, Parallel task scheduling, Probabilistic analysis, Worst-case performance ratio
abstract:In this paper, we consider the problem of scheduling independent parallel tasks in parallel systems with identical processors. The problem is NP-hard, since it includes the bin packing problem as a special case when all tasks have unit execution time. We propose and analyze a simple approximation algorithm called H_m, where m is a positive integer. Algorithm H_m has a moderate asymptotic worst-case performance ratio in the range [1{2/3}..1{13/18}] for all m>=6; but the algorithm has a small asymptotic worst-case performance ratio in the range [1+1/(r+1)..1+1/r], when task sizes do not exceed 1/r of the total available processors, where r>1 is an integer. Furthermore, we show that if the task sizes are independent, identically distributed (i.i.d.) uniform random variables, and task execution times are i.i.d. random variables with finite mean and variance, then the average-case performance ratio of algorithm H_m is no larger than 1.2898680..., and for an exponential distribution of task sizes, it does not exceed 1.2898305.... As demonstrated by our analytical as well as numerical results, the average-case performance ratio improves significantly when tasks request for smaller numbers of processors.
reference: Keqin Li (1999), Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks , Discrete Mathematics and Theoretical Computer Science 3, pp. 155-166
ps.gz-source:dm030403.ps.gz (53 K)
ps-source:dm030403.ps (137 K)
pdf-source:dm030403.pdf (109 K)

The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Automatically produced on Mon Nov 15 14:06:23 CET 1999 by novelli