Sciweavers

173 search results - page 13 / 35
» Special Cases of Online Parallel Job Scheduling
Sort
View
COCOA
2008
Springer
13 years 9 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
COCOON
2005
Springer
14 years 1 months ago
Min-Energy Voltage Allocation for Tree-Structured Tasks
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
Minming Li, Becky Jie Liu, Frances F. Yao
TPDS
2008
122views more  TPDS 2008»
13 years 7 months ago
Nonmigratory Multiprocessor Scheduling for Response Time and Energy
Energy usage has been an important concern in recent research on online job scheduling, where processors are allowed to vary the speed dynamically so as to save energy whenever pos...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
JSSPP
2007
Springer
14 years 2 months ago
A Self-optimized Job Scheduler for Heterogeneous Server Clusters
Heterogeneous clusters and grid infrastructures are becoming increasingly popular. In these computing infrastructures, machines have different resources, including memory sizes, d...
Elad Yom-Tov, Yariv Aridor
ICALP
2004
Springer
14 years 1 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella