188 search results - page 7 / 38 » Regret Minimization and Job Scheduling |
COR
2007
13 years 7 months ago
2007
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
EOR
2008
13 years 7 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...