Robust scheduling for flexible processing networks

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 nonrestrictive assumptions.

[1]  Albert G. Greenberg,et al.  The nature of data center traffic: measurements & analysis , 2009, IMC '09.

[2]  Armand M. Makowski,et al.  Simple computable bounds for the fork-join queue , 1985 .

[3]  Jean C. Walrand,et al.  On stability and performance of parallel processing systems , 1991, JACM.

[4]  J. Michael Harrison,et al.  Brownian models of multiclass queueing networks: Current status and open problems , 1993, Queueing Syst. Theory Appl..

[5]  P. Konstantopoulos,et al.  Stationary and stability of fork-join networks , 1989, Journal of Applied Probability.

[6]  F. Downton Stochastic Approximation , 1969, Nature.

[7]  Avishai Mandelbaum,et al.  Control of Fork-Join Networks in heavy traffic , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  M. T. Wasan Stochastic Approximation , 1969 .

[9]  J. Dai On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[10]  Jean C. Walrand,et al.  Scheduling tasks with precedence constraints on multiple servers , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Viên Nguyen Processing Networks with Parallel and Sequential Tasks: Heavy Traffic Analysis and Brownian Limits , 1993 .

[12]  Vien Nguyen The Trouble With Diversity--fork-join Networks With Heterogeneous Customer Population , 2015 .

[13]  Sigrún Andradóttir,et al.  Dynamic Server Allocation for Queueing Networks with Flexible Servers , 2003, Oper. Res..

[14]  F. Baccelli,et al.  The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds , 1989, Advances in Applied Probability.

[15]  Jean C. Walrand,et al.  Robust scheduling in a flexible fork-join network , 2014, 53rd IEEE Conference on Decision and Control.

[16]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[17]  Alexander L. Stolyar,et al.  Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule , 2004, Oper. Res..

[18]  R. Durrett Probability: Theory and Examples , 1993 .

[19]  Elena Yudovina,et al.  Tightness of Invariant Distributions of a Large-scale Flexible Service System Under a Priority Discipline , 2012 .

[20]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[21]  Kang G. Shin,et al.  Automated control of multiple virtualized resources , 2009, EuroSys '09.

[22]  Golshid Baharian,et al.  Stability analysis of parallel server systems under longest queue first , 2011, Math. Methods Oper. Res..

[23]  J. Harrison Brownian models of open processing networks: canonical representation of workload , 2000 .

[24]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[25]  H. Teicher,et al.  Probability theory: Independence, interchangeability, martingales , 1978 .