Sciweavers

82 search results - page 4 / 17
» Maximizing Job Completions Online
Sort
View
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
14 years 1 months ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
HPCC
2007
Springer
14 years 1 months ago
Online Algorithms for Single Machine Schedulers to Support Advance Reservations from Grid Jobs
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
Bo Li, Dongfeng Zhao
SCHEDULING
2008
97views more  SCHEDULING 2008»
13 years 7 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
Philip Kaminsky, Zu-Hsu Lee
FUZZIEEE
2007
IEEE
13 years 11 months ago
Genetic Fuzzy Systems applied to Online Job Scheduling
Abstract-- This paper presents a comparison of three different design concepts for Genetic Fuzzy systems. We apply a Symbiotic Evolution that uses the Michigan approach and two app...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
PDP
2010
IEEE
13 years 11 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...