Subscribe

Ljubljana, Slovenia

Oct. 13, 2003 to Oct. 14, 2003

ISBN: 0-7695-2069-3

pp: 80

Noriyuki Fujimoto , Osaka University, Japan

Kenichi Hagihara , Osaka University, Japan

ABSTRACT

The most common objective function of task scheduling problems is makespan. However, on a computational grid, the 2nd optimal makespan may be much longer than the optimal makespan because the speed of each processor of a grid varies over time. So, if the performance measure is makespan, there is no approximation algorithm in general for scheduling onto a grid. In contrast, recently the authors proposed the computing power consumed by a scheduling as a criterion of the schedule. For the criterion, this paper gives a (1 + \frac{{L_{cp} (n) \cdot m(\log _e (m - 1) + 1)}} {n})-approximation algorithm for scheduling precedence constrained coarse-grained tasks with the same length onto a grid where n is the number of tasks, m is the number of processors, and L<sub>cp</sub>(n) is the length of the critical path of the task graph. The proposed algorithm does not use any prediction information on the performance of underlying resources. L<sub>cp</sub>(n) is usually a sublinear function of n. So, the above performance guarantee converges to one as n grows. This result implies a non-trivial result that the computing power consumd by an application on a grid can be limited within (1 + \frac{{L_{cp} (n) \cdot m(\log _e (m - 1) + 1)}} {n}) times that required by an optimal schedule in such a case.

INDEX TERMS

null

CITATION

Noriyuki Fujimoto,
Kenichi Hagihara,
"Near-Optimal Dynamic Task Scheduling of Precedence Constrained Coarse-Grained Tasks onto a Computational Grid",

*ISPDC*, 2003, Parallel and Distributed Computing, International Symposium on, Parallel and Distributed Computing, International Symposium on 2003, pp. 80, doi:10.1109/ISPDC.2003.1267647