Mean sojourn times in two-queue fork-join systems: bounds and approximations

DOI10.1007/s00291-010-0235-yzbMath1244.90066OpenAlexW2123807455WikidataQ56641093 ScholiaQ56641093MaRDI QIDQ443829

M. R. H. Mandjes, Benjamin Kemper

Publication date: 13 August 2012

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-010-0235-y

zbMATH Keywords

queueingsimulationsynchronizationparallel processingthroughput timefork-join network

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (3)

Stochastic bounds in Fork-Join queueing systems under full and partial mapping ⋮ Reducing Response Time in Fork-Join Systems under Heavy Traffic Via Imbalance Control ⋮ A computational approach to optimized appointment scheduling

Cites Work

• Unnamed Item
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Two Parallel Queues Created by Arrivals with Two Demands I
• Two Parallel Queues Created by Arrivals with Two Demands II
• Approximate Analysis of General Queuing Networks by Decomposition
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Sojourn times in G/M/1 fork‐join networks
• Statistical Analysis of a Telephone Call Center

This page was built for publication: Mean sojourn times in two-queue fork-join systems: bounds and approximations