Stochastic bounds in Fork-Join queueing systems under full and partial mapping
DOI10.1007/S11134-016-9486-XzbMATH Open1348.90204OpenAlexW2460371668MaRDI QIDQ335902FDOQ335902
Amr Rizk, Florin Ciucu, Felix Poloczek
Publication date: 10 November 2016
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-016-9486-x
Recommendations
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- Stochastic comparisons for fork-join queues with exponential processing times
- Large fork-join queues with nearly deterministic arrival and service times
- On the Diffusion Approximation to a Fork and Join Queueing Model
- A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
- A note on stochastic bounds for queueing networks
- scientific article; zbMATH DE number 2032442
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- On the theory of order statistics
- Two Parallel Queues Created by Arrivals with Two Demands I
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- Stochastic network calculus.
- Queueing Analysis of a Reordering Issue
- Exponential bounds for queues with Markovian arrivals
- Big queues.
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case
- An End-to-End Approach to the Resequencing Problem
- Exponential upper bounds via martingales for multiplexers with Markovian arrivals
- Mean sojourn times in two-queue fork-join systems: bounds and approximations
- Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sojourn times in G/M/1 fork‐join networks
- Title not available (Why is that?)
Cited In (8)
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
- Open problems in queueing theory inspired by datacenter computing
- Stochastic comparisons for fork-join queues with exponential processing times
- Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing
- Delay asymptotics and bounds for multitask parallel jobs
- Biased Processor Sharing in Fork-Join Queues
- Dynamic control of the join-queue lengths in saturated fork-join stations
Uses Software
This page was built for publication: Stochastic bounds in Fork-Join queueing systems under full and partial mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335902)
