Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
From MaRDI portal
Publication:1210481
DOI10.1214/aoap/1177005506zbMath0771.60082OpenAlexW1991290989MaRDI QIDQ1210481
Publication date: 4 October 1993
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177005506
performance analysisqueueing theorysojourn time analysismultidimensional reflected Brownian motionsteady-state throughput time
Queueing theory (aspects of probability theory) (60K25) Brownian motion (60J65) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (10)
On positive recurrence of constrained diffusion processes ⋮ Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services ⋮ Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources ⋮ Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times ⋮ Tail asymptotics for the delay in a Brownian fork-join queue ⋮ Response times in M/M/s fork-join networks ⋮ Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic ⋮ On the Control of Fork-Join Networks ⋮ Robust scheduling for flexible processing networks ⋮ A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
This page was built for publication: Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
