Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
An Almost-Linear Algorithm for Two-Processor Scheduling
Journal of the ACM (JACM)
Approximation algorithms
SETI@home: an experiment in public-resource computing
Communications of the ACM
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Adaptive Scheduling for Master-Worker Applications on the Computational Grid
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
A scheduling expert advisor for heterogeneous environments
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
A Unified Resource Scheduling Framework for Heterogeneous Computing Environments
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Master/Slave Computing on the Grid
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
The Software Architecture of a Virtual Distributed Computing Environment
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
NP-complete scheduling problems
Journal of Computer and System Sciences
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling
IEEE Transactions on Computers
Proceedings of the 43rd annual Southeast regional conference - Volume 1
A dynamic approach for scheduling dependent tasks on the Xavantes grid middleware
Proceedings of the 4th international workshop on Middleware for grid computing
Practical Scheduling of Bag-of-Tasks Applications on Grids with Dynamic Resilience
IEEE Transactions on Computers
Self-adjustment of resource allocation for grid applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computational models and heuristic methods for Grid scheduling problems
Future Generation Computer Systems
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Weight-balanced security-aware scheduling for real-time computational grid
International Journal of Grid and Utility Computing
CPOC: effective static task scheduling for grid computing
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Hi-index | 0.01 |
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 schedule as a criterion of the schedule. For the criterion, this paper gives a (1 + Lcp(n)ċm(loge(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 Lcp(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. Lcp(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 consumed by an application on a grid can be limited within (1 + Lcp(n)ċm(loge(m-1)+1)/n) times that required by an optimal schedule in such a case.