Sciweavers

103 search results - page 15 / 21
» Online weighted flow time and deadline scheduling
Sort
View
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
14 years 7 days ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
CORR
2006
Springer
74views Education» more  CORR 2006»
13 years 8 months ago
Scheduling Algorithms for Procrastinators
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
Michael A. Bender, Raphaël Clifford, Kostas T...
BIRTHDAY
2009
Springer
14 years 17 days ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
COCOON
2005
Springer
14 years 2 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
ICC
2007
IEEE
132views Communications» more  ICC 2007»
14 years 13 days ago
Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time
In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, w...
Bin Bin Chen, Pascale Vicat-Blanc Primet