Sciweavers

173 search results - page 7 / 35
» Special Cases of Online Parallel Job Scheduling
Sort
View
CJ
2008
110views more  CJ 2008»
15 years 6 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
ANOR
2010
130views more  ANOR 2010»
15 years 3 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
RTSS
2005
IEEE
15 years 11 months ago
Energy-Aware Modeling and Scheduling of Real-Time Tasks for Dynamic Voltage Scaling
Abstract— Dynamic voltage scaling (DVS) is a promising technique for battery-powered systems to conserve energy consumption. Most existing DVS algorithms assume information about...
Xiliang Zhong, Cheng-Zhong Xu
JSSPP
2005
Springer
15 years 11 months ago
An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering
Recently HP Labs engaged in a joint project with DreamWorks Animation to develop a Utility Rendering Service that was used to render part of the computer-animated feature film Shr...
Yunhong Zhou, Terence Kelly, Janet L. Wiener, Eric...
FOCS
2008
IEEE
16 years 13 days ago
The Power of Reordering for Online Minimum Makespan Scheduling
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Matthias Englert, Deniz Özmen, Matthias Weste...