312 search results - page 6 / 63 » On the Design and Evaluation of Job Scheduling Algorithms |
SIGECOM
2004
ACM
14 years 1 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
JSSPP
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
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...
RTCSA
2003
IEEE
14 years 26 days ago
2003
IEEE
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...