Sciweavers

254 search results - page 27 / 51
» Approximation Algorithms for Scheduling Parallel Jobs
Sort
View
132
Voted
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
14 years 9 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
ISPDC
2007
IEEE
15 years 5 months ago
Divisible Load Scheduling: An Approach Using Coalitional Games
Scheduling divisible loads in distributed systems is the subject of Divisible Load Theory (DLT). In this paper we show that coalitional game theory is a natural fit for modeling ...
Thomas E. Carroll, Daniel Grosu
CCGRID
2009
IEEE
15 years 5 months ago
Developing Scheduling Policies in gLite Middleware
We describe our experiences from implementing and integrating a new job scheduling algorithm in the gLite Grid middleware and present experimental results that compare it to the e...
A. Kretsis, Panagiotis C. Kokkinos, Emmanouel A. V...
SPAA
2003
ACM
15 years 4 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
CJ
2008
110views more  CJ 2008»
14 years 11 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