Dynamic Scheduling of a Parallel Server System in Heavy Traffic with Complete Resource Pooling: Asymptotic Optimality of a Threshold Policy
Steven L. Bell, University of California, San Diego
Ruth J. Williams, University of California, San Diego
Abstract
We consider a parallel server queueing system consisting of
a bank of buffers for holding incoming jobs
and a bank of flexible servers for processing
these jobs.
Incoming jobs are classified into one of several different
classes (or buffers).
Jobs within a class are processed on a first-in-first-out basis,
where the processing of a given job may be performed
by any server from a given (class-dependent) subset
of the bank of servers.
The random service time of a job may depend on both its class
and the server providing the service.
Each job departs the system after receiving service from one server.
The system manager seeks to minimize
holding costs by dynamically scheduling waiting jobs to available servers.
We consider a parameter regime in which the system satisfies
both a heavy traffic and a complete resource pooling condition.
Our cost function is an expected cumulative discounted cost of
holding jobs in the system, where the (undiscounted) cost per unit
time is a linear function of normalized (with heavy traffic scaling)
queue length.
In a prior work,
the second author proposed
a continuous review
threshold control policy for use in such a parallel server system.
This policy was advanced as an "interpretation" of
the analytic solution to an associated Brownian control problem (formal
heavy traffic diffusion approximation).
In this paper we show that the policy proposed previously is asymptotically
optimal in the heavy traffic limit and that the limiting cost is the same
as the optimal cost in the Brownian control problem.
Full text: PDF | PostScript
Copyright for articles published in this journal is retained by the authors, with first publication rights granted to the journal. By virtue of their appearance in this open access journal, articles are free to use, with proper attribution, in educational and other non-commercial settings.
The authors of papers published in EJP/ECP retain the copyright. We ask for the permission to use the material in any form. We also require that the initial publication in EJP or ECP is acknowledged in any future publication of the same article.
Before a paper is published in the Electronic Journal of Probability or Electronic Communications in Probability we must receive a hard-copy of the copyright form. Please mail it to
Philippe Carmona
Laboratoire Jean Leray UMR 6629
Universite de Nantes,
2, Rue de la Houssinière BP 92208
F-44322 Nantes Cédex 03
France
You can also send it by FAX: (33|0) 2 51 12 59 12 to the attention of Philippe Carmona. You can even send a scanned jpeg or pdf of this copyright form to the managing editor ejpecpme@math.univ-nantes.fr. as an attached file.
If a paper has several authors, the corresponding author signs the copyright form on behalf of all the authors.