Deciding which queue to join: Some counterexamples
Operations Research
Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Task assignment with unknown duration
Journal of the ACM (JACM)
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
Operations Research
A parallel workload model and its implications for processor allocation
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
Mixed scheduling disciplines for network flows
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
Nearly insensitive bounds on SMART scheduling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
Performance Evaluation - Performance 2005
ACM SIGMETRICS Performance Evaluation Review
Analysis of join-the-shortest-queue routing for web server farms
Performance Evaluation
Surprising results on task assignment in server farms with high-variability workloads
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Performance Evaluation
On the Gittins index in the M/G/1 queue
Queueing Systems: Theory and Applications
M/M/1-PS queue and size-aware task assignment
Performance Evaluation
Dispatching problem with fixed size jobs and processor sharing discipline
Proceedings of the 23rd International Teletraffic Congress
The price of anarchy in an exponential multi-server
Operations Research Letters
Lookahead actions in dispatching to parallel queues
Performance Evaluation
| Hi-index | 0.00 |
We consider a system of parallel queues where tasks are assigned (dispatched) to one of the available servers upon arrival. The dispatching decision is based on the full state information, i.e., on the sizes of the new and existing jobs. We are interested in minimizing the so-called mean slowdown criterion corresponding to the mean of the sojourn time divided by the processing time. Assuming no new jobs arrive, the shortest-processing-time-product (SPTP) schedule is known to minimize the slowdown of the existing jobs. The main contribution of this paper is three-fold: 1) To show the optimality of SPTP with respect to slowdown in a single server queue under Poisson arrivals; 2) to derive the so-called size-aware value functions for M/G/1-FIFO/LIFO/SPTP with general holding costs of which the slowdown criterion is a special case; and 3) to utilize the value functions to derive efficient dispatching policies so as to minimize the mean slowdown in a heterogeneous server system. The derived policies offer a significantly better performance than e.g., the size-aware-task-assignment with equal load (SITA-E) and least-work-left (LWL) policies.