Threshold-based priority policies for parallel-server systems with affinity scheduling

Abstract

We study the dynamic scheduling of multiclass parallel-server stochastic networks and propose a general class of threshold-based priority policies. A number of examples are considered to illustrate the use of our algorithm for determining the placement of thresholds and to quantify the benefits of the proposed policies. We derive approximate formulas for the queue lengths under our threshold-based priority policies and we illustrate how these formulas can be used to obtain optimal threshold values.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 44 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.