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

DOI10.1007/s10479-008-0312-7zbMath1140.90021OpenAlexW2115310413MaRDI QIDQ928219

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

Publication date: 11 June 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0312-7

zbMATH Keywords

matrix-analytic methodsstochastic networksstochastic decompositionquasi-birth-death processesparallel-server fork-join queues

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (2)

Exact Monte Carlo simulation for fork-join networks ⋮ Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic

Uses Software

• EMpht

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Loss networks
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
• Level phase independence for GI/M/1-type Markov chains
• A Proof for the Queuing Formula: L = λW
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• A logarithmic reduction algorithm for quasi-birth-death processes
• Response times in M/M/s fork-join networks
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes

This page was built for publication: Generalized parallel-server fork-join queues with dynamic task scheduling