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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

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
Title of host publicationValueTools 2016 - 10th EAI International Conference on Performance Evaluation Methodologies and Tools
PublisherACM
Pages161
Number of pages1
ISBN (Electronic)9781631901416
DOIs
Publication statusPublished - 2017
MoE publication typeA4 Article in a conference publication
EventInternational Conference on Performance Evaluation Methodologies and Tools - Taormina, Italy
Duration: 25 Oct 201628 Oct 2016
Conference number: 10

Conference

ConferenceInternational Conference on Performance Evaluation Methodologies and Tools
Abbreviated titleVALUETOOLS
CountryItaly
CityTaormina
Period25/10/201628/10/2016

Keywords

  • Deadlines
  • Dispatching problem
  • M/D/1
  • 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

    Hyytiä, E., Righter, R., Bilenne, O., & Wu, X. (2017). Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers. In ValueTools 2016 - 10th EAI International Conference on Performance Evaluation Methodologies and Tools (pp. 161). ACM. https://doi.org/10.4108/eai.25-10-2016.2267093