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

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. 2008 Springer Science+Business Media, LLC.

authors

• Gautam, Natarajan

published proceedings

• ANNALS OF OPERATIONS RESEARCH

author list (cited authors)

• Squillante, M. S., Zhang, Y., Sivasubramaniam, A., & Gautam, N.

citation count

• 10

complete list of authors

• Squillante, Mark S||Zhang, Yanyong||Sivasubramaniam, Anand||Gautam, Natarajan

publication date

• April 2008

publisher

• Springer Nature  Publisher

published in

• Annals of Operations Research  Journal

keywords

• Matrix-analytic Methods
• Parallel-server Fork-join Queues
• Quasi-birth-death Processes
• Stochastic Decomposition
• Stochastic Networks

Digital Object Identifier (DOI)

• 10.1007/s10479-008-0312-7

start page

• 227

end page

• 255

volume

• 160

issue

• 1

URL

• http://dx.doi.org/10.1007/s10479-008-0312-7