Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
DOI10.1214/AOAP/1177005506zbMATH Open0771.60082OpenAlexW1991290989MaRDI QIDQ1210481FDOQ1210481
Authors: Viên Nguyen 
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
Recommendations
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- Open Queueing Networks in Heavy Traffic
- Brownian models of multiclass queueing networks: Current status and open problems
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- A network of priority queues in heavy traffic: One bottleneck station
queueing theoryperformance analysissojourn 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)
Cited In (15)
- Throughput scalability analysis of fork-join queueing networks
- A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
- Brownian models of open processing networks: Canonical representation of workload.
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- 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
- On the control of fork-join networks
- On positive recurrence of constrained diffusion processes
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- Workload Interpretation for Brownian Models of Stochastic Processing Networks
- Robust scheduling for flexible processing networks
- Tail asymptotics for the delay in a Brownian fork-join queue
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- Large fork-join queues with nearly deterministic arrival and service times
- Response times in M/M/s fork-join networks
This page was built for publication: Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1210481)
