STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Analysis of first-come-first-serve parallel job scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the Design and Evaluation of Job Scheduling Algorithms
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Bi-criteria algorithm for scheduling jobs on cluster platforms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Non-clair voy ant multiprocessor scheduling of jobs with changing execution characteristics
Journal of Scheduling - Special issue: On-line scheduling
Resource constrained scheduling on multiple machines
Information Processing Letters
A job scheduling framework for large computing farms
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Improved results for scheduling batched parallel jobs by using a generalized analysis framework
Journal of Parallel and Distributed Computing
Provably efficient two-level adaptive scheduling
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
FLEX: a slot allocation scheduling optimizer for MapReduce workloads
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
On the optimization of schedules for MapReduce workloads in the presence of shared scans
The VLDB Journal — The International Journal on Very Large Data Bases
A multi-criteria job scheduling framework for large computing farms
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Consider a system of independent tasks to be scheduled without preemption on a parallel computer. For each task the number of processors required, the execution time, and a weight are known. The problem is to find a schedule with minimum weighted average response time. We present an algorithm called SMART (which stands for scheduling to minimize average response time) for this problem that produces solutions that are within a factor of 8.53 of optimal. To our knowledge this is the first polynomial-time algorithm for the minimum weighted average response time problem that achieves a constant bound. In addition, for the unweighted case (that is, where all the weights are unity) we describe a variant of SMART that produces solutions that are within a factor of 8 of optimal, improving upon the best known bound of 32 for this special case.