A TAXONOMY OF TASK SCHEDULING ALGORITHMS IN THE GRID
Author:
- 1 December 2007
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 17 (04) , 439-454
Abstract
One motivation of Grid computing is to aggregate the power of widely distributed resources, and provide non-trivial services to users. To achieve this goal, efficient task scheduling algorithms are essential. However, scheduling algorithms in the Grid present high diversities that need to be classified. In this paper, with the help of an abstract scheduling architecture, some key features of the task scheduling problem in the Grid are discussed, followed by a taxonomy of the scheduling algorithms. Some typical examples are given in each category to present a picture of the current research and help to find new research problems.Keywords
This publication has 18 references indexed in Scilit:
- A Tool for Prioritizing DAGMan Jobs and its EvaluationJournal of Grid Computing, 2007
- Entropic Grid SchedulingJournal of Grid Computing, 2006
- Toward a theory for scheduling dags in Internet-based computingIEEE Transactions on Computers, 2006
- Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the GridJournal of Grid Computing, 2006
- The Grid EconomyProceedings of the IEEE, 2005
- Quality of Service on the Grid Via Metascheduling with Resource Co-Scheduling and Co-ReservationThe International Journal of High Performance Computing Applications, 2003
- QoS guided Min-Min heuristic for grid task schedulingJournal of Computer Science and Technology, 2003
- Adaptive computing on the grid using AppLeSIEEE Transactions on Parallel and Distributed Systems, 2003
- Grids and Grid technologies for wide‐area distributed computingSoftware: Practice and Experience, 2002
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001