Stochastic bounds in Fork-Join queueing systems under full and partial mapping
From MaRDI portal
Publication:335902
DOI10.1007/s11134-016-9486-xzbMath1348.90204OpenAlexW2460371668MaRDI QIDQ335902
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
Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing, Biased Processor Sharing in Fork-Join Queues, Open problems in queueing theory inspired by datacenter computing, Delay asymptotics and bounds for multitask parallel jobs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mean sojourn times in two-queue fork-join systems: bounds and approximations
- Exponential bounds for queues with Markovian arrivals
- Big queues.
- Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic
- Two Parallel Queues Created by Arrivals with Two Demands I
- On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case
- An End-to-End Approach to the Resequencing Problem
- Queueing Analysis of a Reordering Issue
- Exponential upper bounds via martingales for multiplexers with Markovian arrivals
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
- Sojourn times in G/M/1 fork‐join networks
- On the theory of order statistics
