Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers

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

doi:10.1007/978-3-319-92378-9_3

Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers

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

^*Tämän työn vastaava kirjoittaja

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Chapter › Scientific › vertaisarvioitu

2 Sitaatiot (Scopus)

Abstrakti

We study the M/D/1 queue and its generalization, the M/iD/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. The M/iD/1 queue enables us to model both varying jobs sizes and batch arrival processes. We derive explicit value functions for these M/D/1-type of queues that enable the development of efficient cost-aware dispatching policies to parallel servers.

Alkuperäiskieli	Englanti
Otsikko	EAI/Springer Innovations in Communication and Computing
Kustantaja	Springer
Sivut	29-46
Sivumäärä	18
ISBN (elektroninen)	978-3-319-92378-9
ISBN (painettu)	978-3-319-92377-2
DOI - pysyväislinkit	https://doi.org/10.1007/978-3-319-92378-9_3
Tila	Julkaistu - 1 tammik. 2019
OKM-julkaisutyyppi	A3 Kirjan tai muun kokoomateoksen osa

Julkaisusarja

Nimi	EAI/Springer Innovations in Communication and Computing
ISSN (painettu)	2522-8595
ISSN (elektroninen)	2522-8609

Pääsy asiakirjaan

10.1007/978-3-319-92378-9_3

OpenUrl-saatavuus

Koko teksti

Muut tiedostot ja linkit

Link to publication in Scopus

Faster Queues for Big Data - Nopeammat jonot suurten tietomassojen käsittelyyn
Hyytiä, E., Aalto, S., Viitasaari, L., Wu, X., Bilenne, O. & Osti, P.
01/01/2016 → 31/12/2017
Projekti: Academy of Finland: Other research funding

Siteeraa tätä

@inbook{3d48193c42f24f029dd4934ff2ee9f5c,

title = "Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers",

abstract = "We study the M/D/1 queue and its generalization, the M/iD/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. The M/iD/1 queue enables us to model both varying jobs sizes and batch arrival processes. We derive explicit value functions for these M/D/1-type of queues that enable the development of efficient cost-aware dispatching policies to parallel servers.",

keywords = "Batch Arrivals, Job Size, Parallel Servers, Varying Job Sizes, Violation Cost",

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

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-319-92378-9_3",

language = "English",

isbn = "978-3-319-92377-2",

series = "EAI/Springer Innovations in Communication and Computing",

publisher = "Springer",

pages = "29--46",

booktitle = "EAI/Springer Innovations in Communication and Computing",

address = "Germany",

}

Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers. / Hyytiä, Esa; Righter, Rhonda; Bilenne, Olivier et al.
EAI/Springer Innovations in Communication and Computing. Springer, 2019. s. 29-46 (EAI/Springer Innovations in Communication and Computing).

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Chapter › Scientific › vertaisarvioitu

TY - CHAP

T1 - Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers

AU - Hyytiä, Esa

AU - Righter, Rhonda

AU - Bilenne, Olivier

AU - Wu, Xiaohu

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We study the M/D/1 queue and its generalization, the M/iD/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. The M/iD/1 queue enables us to model both varying jobs sizes and batch arrival processes. We derive explicit value functions for these M/D/1-type of queues that enable the development of efficient cost-aware dispatching policies to parallel servers.

AB - We study the M/D/1 queue and its generalization, the M/iD/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. The M/iD/1 queue enables us to model both varying jobs sizes and batch arrival processes. We derive explicit value functions for these M/D/1-type of queues that enable the development of efficient cost-aware dispatching policies to parallel servers.

KW - Batch Arrivals

KW - Job Size

KW - Parallel Servers

KW - Varying Job Sizes

KW - Violation Cost

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

U2 - 10.1007/978-3-319-92378-9_3

DO - 10.1007/978-3-319-92378-9_3

M3 - Chapter

AN - SCOPUS:85090525184

SN - 978-3-319-92377-2

T3 - EAI/Springer Innovations in Communication and Computing

SP - 29

EP - 46

BT - EAI/Springer Innovations in Communication and Computing

PB - Springer

ER -

Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers

Abstrakti

Julkaisusarja

Pääsy asiakirjaan

OpenUrl-saatavuus

Muut tiedostot ja linkit

Sormenjälki

Projektit

Faster Queues for Big Data - Nopeammat jonot suurten tietomassojen käsittelyyn

Siteeraa tätä