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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific › peer-review

2 Citations (Scopus)

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.

Original language	English
Title of host publication	EAI/Springer Innovations in Communication and Computing
Publisher	Springer
Pages	29-46
Number of pages	18
ISBN (Electronic)	978-3-319-92378-9
ISBN (Print)	978-3-319-92377-2
DOIs	https://doi.org/10.1007/978-3-319-92378-9_3
Publication status	Published - 1 Jan 2019
MoE publication type	A3 Book section, Chapters in research books

Publication series

Name	EAI/Springer Innovations in Communication and Computing
ISSN (Print)	2522-8595
ISSN (Electronic)	2522-8609

Keywords

Batch Arrivals
Job Size
Parallel Servers
Varying Job Sizes
Violation Cost

Access to Document

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

OpenUrl availability

Full text

Cite this

@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. p. 29-46 (EAI/Springer Innovations in Communication and Computing).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific › peer-review

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

Abstract

Publication series

Keywords

Access to Document

OpenUrl availability

Other files and links

Fingerprint

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

Cite this

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

Abstract

Publication series

Keywords

Access to Document

OpenUrl availability

Other files and links

Fingerprint

Projects

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

Cite this