Robust scheduling for flexible processing networks
From MaRDI portal
Publication:5233182
DOI10.1017/apr.2017.14zbMath1425.60079arXiv1610.03803OpenAlexW2962794893MaRDI QIDQ5233182
Jean Walrand, Ramtin Pedarsani, Yuan Zhong
Publication date: 16 September 2019
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.03803
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Sample path properties (60G17)
Related Items
Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources ⋮ Information and Memory in Dynamic Resource Allocation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic approximation. A dynamical systems viewpoint.
- Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- Brownian models of open processing networks: Canonical representation of workload.
- Brownian models of multiclass queueing networks: Current status and open problems
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Stability analysis of parallel server systems under longest queue first
- Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
- Stationary and stability of fork-join networks
- Dynamic Server Allocation for Queueing Networks with Flexible Servers
- On stability and performance of parallel processing systems
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- Tightness of invariant distributions of a large-scale flexible service system under a priority discipline
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
- Probability
