Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers

Esa Hyytiä*, Rhonda Righter, Olivier Bilenne, Xiaohu Wu

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

5 Citations (Scopus)
130 Downloads (Pure)

Abstract

We study the M/D/1 queue when jobs have firm deadlines for waiting (or sojourn) time. If a deadline is not met, a job-specific deadline violation cost is incurred. We derive explicit value functions for this M/D/1 queue that enable the development of efficient cost-aware dispatching policies to parallel servers. The performance of the resulting dispatching policies is evaluated by means of simulations.

Original languageEnglish
Pages (from-to)32-44
Number of pages13
JournalPerformance Evaluation
Volume114
DOIs
Publication statusPublished - 25 May 2017
MoE publication typeA1 Journal article-refereed

Keywords

  • Deadlines
  • Dispatching problem
  • M/D/1
  • MDP
  • Parallel computing

Fingerprint Dive into the research topics of 'Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers'. Together they form a unique fingerprint.

  • Cite this