Sciweavers

1050 search results - page 19 / 210
» Online scheduling in grids
Sort
View
CJ
2008
110views more  CJ 2008»
13 years 7 months ago
Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
Keqin Li
ORL
1998
97views more  ORL 1998»
13 years 7 months ago
Preemptive on-line scheduling for two uniform processors
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
Jianjun Wen, Donglei Du
HPDC
2005
IEEE
14 years 1 months ago
Cost-based scheduling for data-intensive applications on global grids
We present an algorithm for scheduling distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing da...
Srikumar Venugopal, Rajkumar Buyya
CORR
2007
Springer
142views Education» more  CORR 2007»
13 years 7 months ago
Resource and Application Models for Advanced Grid Schedulers
: As Grid computing is becoming an inevitable future, managing, scheduling and monitoring dynamic, heterogeneous resources will present new challenges. Solutions will have to be ag...
Aleksandar Lazarevic, Lionel Sacks
MIDDLEWARE
2007
Springer
14 years 1 months ago
New Worker-Centric Scheduling Strategies for Data-Intensive Grid Applications
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
Steven Y. Ko, Ramsés Morales, Indranil Gupt...