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

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

doi:10.4108/eai.25-10-2016.2267093

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

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

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

Abstrakti

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.

Alkuperäiskieli	Englanti
Otsikko	ValueTools 2016 - 10th EAI International Conference on Performance Evaluation Methodologies and Tools
Kustantaja	ACM
Sivut	161
Sivumäärä	1
ISBN (elektroninen)	9781631901416
DOI - pysyväislinkit	https://doi.org/10.4108/eai.25-10-2016.2267093
Tila	Julkaistu - 2017
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	International Conference on Performance Evaluation Methodologies and Tools - Taormina, Italia Kesto: 25 lokakuuta 2016 → 28 lokakuuta 2016 Konferenssinumero: 10

Conference

Conference	International Conference on Performance Evaluation Methodologies and Tools
Lyhennettä	VALUETOOLS
Maa	Italia
Kaupunki	Taormina
Ajanjakso	25/10/2016 → 28/10/2016

Pääsy asiakirjaan

10.4108/eai.25-10-2016.2267093

Link to publication in Scopus

Sormenjälki Sukella tutkimusaiheisiin 'Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä

@inproceedings{104cf130ab9646139f84400f6fb04da0,

title = "Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers",

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.",

keywords = "Deadlines, Dispatching problem, M/D/1, Parallel computing",

author = "Esa Hyyti{\"a} and Rhonda Righter and Olivier Bilenne and Xiaohu Wu",

year = "2017",

doi = "10.4108/eai.25-10-2016.2267093",

language = "English",

pages = "161",

booktitle = "ValueTools 2016 - 10th EAI International Conference on Performance Evaluation Methodologies and Tools",

publisher = "ACM",

note = "International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS ; Conference date: 25-10-2016 Through 28-10-2016",

}

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

Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers. / Hyytiä, Esa; Righter, Rhonda; Bilenne, Olivier; Wu, Xiaohu.

ValueTools 2016 - 10th EAI International Conference on Performance Evaluation Methodologies and Tools. ACM, 2017. s. 161.

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

TY - GEN

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

AU - Hyytiä, Esa

AU - Righter, Rhonda

AU - Bilenne, Olivier

AU - Wu, Xiaohu

N1 - Conference code: 10

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

KW - Deadlines

KW - Dispatching problem

KW - M/D/1

KW - Parallel computing

UR - http://www.scopus.com/inward/record.url?scp=85021346738&partnerID=8YFLogxK

U2 - 10.4108/eai.25-10-2016.2267093

DO - 10.4108/eai.25-10-2016.2267093

M3 - Conference contribution

AN - SCOPUS:85021346738

SP - 161

BT - ValueTools 2016 - 10th EAI International Conference on Performance Evaluation Methodologies and Tools

PB - ACM

T2 - International Conference on Performance Evaluation Methodologies and Tools

Y2 - 25 October 2016 through 28 October 2016

ER -