Asymptotically optimal interruptible service policies for scheduling jobs in a diffusion regime with nondegenerate slowdown

Asymptotically optimal interruptible service policies for scheduling jobs in a diffusion regime with nondegenerate slowdown

0.00 Avg rating0 Votes
Article ID: iaor201113503
Volume: 69
Issue: 3
Start Page Number: 217
End Page Number: 235
Publication Date: Dec 2011
Journal: Queueing Systems
Authors: ,
Keywords: networks, networks: flow, networks: scheduling, queues: applications, allocation: resources, programming: convex, stochastic processes
Abstract:

A parallel server system is considered, with I customer classes and many servers, operating in a heavy traffic diffusion regime where the queueing delay and service time are of the same order of magnitude. Denoting by X ˆ n equ1 and Q ˆ n equ2 , respectively, the diffusion scale deviation of the headcount process from the quantity corresponding to the underlying fluid model and the diffusion scale queue‐length, we consider minimizing r.v.’s of the form c X n = 0 u C ( X ˆ n ( t ) ) dt equ3 and c Q n = 0 u C ( Q ˆ n ( t ) ) dt equ4 over policies that allow for service interruption. Here, C:ℝ I→ℝ+ is continuous, and u>0. Denoting by θ the so‐called workload vector, it is assumed that C * ( w ) : = min { C ( q ) : q + I , θ q = w } equ5 is attained along a continuous curve as w varies in ℝ+. We show that any weak limit point of c X n equ6 stochastically dominates the r.v. 0 u C * ( W ( t ) ) dt equ7 for a suitable reflected Brownian motion W and construct a sequence of policies that asymptotically achieve this lower bound. For c Q n equ8 , an analogous result is proved when, in addition, C * is convex. The construction of the policies takes full advantage of the fact that in this regime the number of servers is of the same order as the typical queue‐length.

Reviews

Required fields are marked *. Your email address will not be published.