Large fork-join queues with nearly deterministic arrival and service times
From MaRDI portal
Publication:5085144
Abstract: In this paper, we study an server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as . This fluid limit depends on the initial number of tasks. In order to prove these results, we develop extreme value theory and diffusion approximations for the queue lengths.
Recommendations
- A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- Bivariate distributions of maximum remaining service times in fork-join infinite-server queues
- Analysis of the fork-join queue
- Mean sojourn times in two-queue fork-join systems: bounds and approximations
Cites work
- Almost sure limit sets of random samples in ℝd
- Extreme values of independent stochastic processes
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
- Heavy-traffic limits for nearly deterministic queues
- Heavy-traffic limits for nearly deterministic queues: Stationary distributions
- scientific article; zbMATH DE number 4078444 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Limiting Sets and Convex Hulls of Samples from Product Measures
- Maxima of Poisson-like variables and related triangular arrays
- Moment Convergence of Sample Extremes
- On the constant in the nonuniform version of the Berry-Ess�en theorem
- Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
- Response times in M/M/s fork-join networks
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- Two parallel processors with coupled inputs
- Two Parallel Queues Created by Arrivals with Two Demands I
Cited in
(11)- Dynamic control of the join-queue lengths in saturated fork-join stations
- Bivariate distributions of maximum remaining service times in fork-join infinite-server queues
- ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
- Heavy-traffic limits for nearly deterministic queues
- Stochastic bounds in Fork-Join queueing systems under full and partial mapping
- Stochastic comparisons for fork-join queues with exponential processing times
- Fork and Join Queueing Networks with Heavy Tails: Scaling Dimension and Throughput Limit
- Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System
- Tail asymptotics for the delay in a Brownian fork-join queue
- Appointment scheduling for parallel queues
- Extreme values for the waiting time in large fork-join queues
This page was built for publication: Large fork-join queues with nearly deterministic arrival and service times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085144)