ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
From MaRDI portal
Publication:3087798
DOI10.1017/S0269964810000112zbMath1219.90045OpenAlexW2168928846WikidataQ56769507 ScholiaQ56769507MaRDI QIDQ3087798
Publication date: 17 August 2011
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964810000112
Cites Work
- Synchronized queues with deterministic arrivals
- Triggered concurrent batch arrivals and batch departures in queueing networks
- A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
- A performance evaluation of several priority policies for parallel processing systems
- Induced rare events: analysis via large deviations and time reversal
- Two Parallel Queues Created by Arrivals with Two Demands I
- Analytical Results for Waiting Time and System Size Distributions in Two Parallel Queueing Systems
- A General Class of Closed Fork and Join Queues with Subexponential Service Times
- Two Parallel Queues Created by Arrivals with Two Demands II
- Analytic Queueing Models for Programs with Internal Concurrency
- Two parallel processors with coupled inputs
- Order-Fulfillment Performance Measures in an Assemble-to-Order System with Stochastic Leadtimes
- Response times in M/M/s fork-join networks
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
This page was built for publication: ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
