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

DOI10.1007/S00291-010-0235-YMaRDI QIDQ443829zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Benjamin Kemper, M. R. H. Mandjes

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)

Recommendations

• Analysis of the fork-join queue
• Sojourn times in G/M/1 fork-join networks
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
• scientific article; zbMATH DE number 2196402

Cites work

• scientific article; zbMATH DE number 1183924 (Why is no real title available?)
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Approximate Analysis of General Queuing Networks by Decomposition
• Sojourn times in G/M/1 fork-join networks
• Statistical Analysis of a Telephone Call Center
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Two Parallel Queues Created by Arrivals with Two Demands I
• Two Parallel Queues Created by Arrivals with Two Demands II

Cited in

(14)

• Response times in M/M/s fork-join networks
• Analysis of the fork-join queue
• Reducing Response Time in Fork-Join Systems under Heavy Traffic Via Imbalance Control
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• scientific article; zbMATH DE number 148327 (Why is no real title available?)
• Exact Monte Carlo simulation for fork-join networks
• Stochastic bounds in Fork-Join queueing systems under full and partial mapping
• An approximation method for general closed queuing networks with Fork/Join mechanisms
• Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing
• A computational approach to optimized appointment scheduling
• Biased Processor Sharing in Fork-Join Queues
• scientific article; zbMATH DE number 2196402 (Why is no real title available?)
• Sojourn times in G/M/1 fork-join networks
• Large fork-join queues with nearly deterministic arrival and service times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443829)