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

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

0.00 Avg rating0 Votes
Article ID: iaor20091422
Country: Netherlands
Volume: 160
Issue: 1
Start Page Number: 227
End Page Number: 255
Publication Date: Apr 2008
Journal: Annals of Operations Research
Authors: , , ,
Keywords: markov processes
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.

Reviews

Required fields are marked *. Your email address will not be published.