Generalized parallel-server fork-join queues with dynamic task scheduling

Mark S. Squillante, Yanyong Zhang, Anand Sivasubramaniam, Natarajan Gautam

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic polices are considered for scheduling multiple tasks at each of the single-server queues to maintain effective server utilization. The paper presents an exact matrix-analytic analysis of generalized parallel-server fork-join queueing systems, for small instances of the stochastic model, and presents an approximate matrix-analytic analysis and fixed-point solution, for larger instances of the model.

Original languageEnglish (US)
Pages (from-to)227-255
Number of pages29
JournalAnnals of Operations Research
Volume160
Issue number1
DOIs
StatePublished - Apr 1 2008

Fingerprint

Queue
Multiple tasks
Join
Queueing system
Communication
Police
Stochastic model
Siblings
Fixed point
Vacation

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this

Squillante, Mark S. ; Zhang, Yanyong ; Sivasubramaniam, Anand ; Gautam, Natarajan. / Generalized parallel-server fork-join queues with dynamic task scheduling. In: Annals of Operations Research. 2008 ; Vol. 160, No. 1. pp. 227-255.
@article{6660ace2492047c4a20c6f0f580017ad,
title = "Generalized parallel-server fork-join queues with dynamic task scheduling",
abstract = "This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic polices are considered for scheduling multiple tasks at each of the single-server queues to maintain effective server utilization. The paper presents an exact matrix-analytic analysis of generalized parallel-server fork-join queueing systems, for small instances of the stochastic model, and presents an approximate matrix-analytic analysis and fixed-point solution, for larger instances of the model.",
author = "Squillante, {Mark S.} and Yanyong Zhang and Anand Sivasubramaniam and Natarajan Gautam",
year = "2008",
month = "4",
day = "1",
doi = "10.1007/s10479-008-0312-7",
language = "English (US)",
volume = "160",
pages = "227--255",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer Netherlands",
number = "1",

}

Generalized parallel-server fork-join queues with dynamic task scheduling. / Squillante, Mark S.; Zhang, Yanyong; Sivasubramaniam, Anand; Gautam, Natarajan.

In: Annals of Operations Research, Vol. 160, No. 1, 01.04.2008, p. 227-255.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Generalized parallel-server fork-join queues with dynamic task scheduling

AU - Squillante, Mark S.

AU - Zhang, Yanyong

AU - Sivasubramaniam, Anand

AU - Gautam, Natarajan

PY - 2008/4/1

Y1 - 2008/4/1

N2 - This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic polices are considered for scheduling multiple tasks at each of the single-server queues to maintain effective server utilization. The paper presents an exact matrix-analytic analysis of generalized parallel-server fork-join queueing systems, for small instances of the stochastic model, and presents an approximate matrix-analytic analysis and fixed-point solution, for larger instances of the model.

AB - This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic polices are considered for scheduling multiple tasks at each of the single-server queues to maintain effective server utilization. The paper presents an exact matrix-analytic analysis of generalized parallel-server fork-join queueing systems, for small instances of the stochastic model, and presents an approximate matrix-analytic analysis and fixed-point solution, for larger instances of the model.

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

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

U2 - 10.1007/s10479-008-0312-7

DO - 10.1007/s10479-008-0312-7

M3 - Article

AN - SCOPUS:39249084971

VL - 160

SP - 227

EP - 255

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -