Sciweavers

173 search results - page 3 / 35
» Special Cases of Online Parallel Job Scheduling
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 6 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
SCHEDULING
2011
13 years 1 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
Michael Gatto, Peter Widmayer
IPPS
2008
IEEE
14 years 22 days ago
Online scheduling in grids
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
Uwe Schwiegelshohn, Andrei Tchernykh, Ramin Yahyap...
PDP
2010
IEEE
13 years 10 months ago
Malleable-Lab: A Tool for Evaluating Adaptive Online Schedulers on Malleable Jobs
—The emergence of multi-core computers has led to explosive development of parallel applications and hence the need of efficient schedulers for parallel jobs. Adaptive online sc...
Yangjie Cao, Hongyang Sun, Wen-Jing Hsu, Depei Qia...
ANSS
2003
IEEE
13 years 11 months ago
Performance Analysis of Parallel Job Scheduling in Distributed Systems
This paper studies parallel job scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Five policies are used to ...
Helen D. Karatza, Ralph C. Hilzer Jr.