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

DOI10.1007/S00291-010-0235-YzbMATH Open1244.90066DBLPjournals/ors/KemperM12OpenAlexW2123807455WikidataQ56641093 ScholiaQ56641093MaRDI QIDQ443829FDOQ443829

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

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

zbMATH Keywords

queueingsimulationsynchronizationparallel processingthroughput timefork-join network

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

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

Cited In (14)

• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Sojourn times in G/M/1 fork-join networks
• Large fork-join queues with nearly deterministic arrival and service times
• Response times in M/M/s fork-join networks

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)