Robust scheduling for flexible processing networks
From MaRDI portal
Publication:5233182
Abstract: Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge in designing efficient scheduling policies in these networks is the lack of reliable estimates of system parameters, and an attractive approach for addressing this challenge is to design robust policies, i.e., policies that do not use system parameters such as arrival and/or service rates for making scheduling decisions. In this paper, we propose a general framework for the design of robust policies. The main technical novelty is the use of a stochastic gradient projection method that reacts to queue-length changes in order to find a balanced allocation of service resources to incoming tasks. We illustrate our approach on two broad classes of processing systems, namely the flexible fork-join networks and the flexible queueing networks, and prove the rate stability of our proposed policies for these networks under non-restrictive assumptions.
Recommendations
- Dynamic Scheduling for a Flexible Processing Network
- Scheduling and stability aspects of a general class of parallel processing systems
- Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- scientific article; zbMATH DE number 786512
Cites work
- scientific article; zbMATH DE number 1278394 (Why is no real title available?)
- scientific article; zbMATH DE number 1076783 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Brownian models of multiclass queueing networks: Current status and open problems
- Brownian models of open processing networks: Canonical representation of workload.
- Dynamic Server Allocation for Queueing Networks with Flexible Servers
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- On stability and performance of parallel processing systems
- Probability. Theory and examples.
- Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- 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
- Stochastic approximation. A dynamical systems viewpoint.
- Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- Tightness of invariant distributions of a large-scale flexible service system under a priority discipline
Cited in
(4)
This page was built for publication: Robust scheduling for flexible processing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233182)
