80 search results - page 4 / 16 » A tight lower bound for job scheduling with cancellation |
HPDC
2002
IEEE
14 years 10 days ago
2002
IEEE
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
IPL
2010
13 years 5 months ago
2010
In this paper, we re-analyse the Rate Monotonic Scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all t...
ISSS
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
EOR
2007
13 years 7 months ago
2007
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...