Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs

Scheduling to minimize mean response time in an M/G/1 queue is a classic problem. The problem is usually addressed in one of two scenarios. In the perfect-information scenario, the scheduler knows each job's exact size, or service requirement. In the zero-information scenario, the scheduler knows only each job's size distribution. The well-known shortest remaining processing time (SRPT) policy is optimal in the perfect-information scenario, and the more complex Gittins policy is optimal in the zero-information scenario. In real systems the scheduler often has partial but incomplete information about each job's size. We introduce a new job model, that of multistage jobs, to capture this partial-information scenario. A multistage job consists of a sequence of stages, where both the sequence of stages and stage sizes are unknown, but the scheduler always knows which stage of a job is in progress. We give an optimal algorithm for scheduling multistage jobs in an M/G/1 queue and an exact response time analysis of our algorithm.

[1]  J. Tsitsiklis,et al.  Branching bandits and Klimov's problem: achievable region and side constraints , 1995, IEEE Trans. Autom. Control..

[2]  Urtzi Ayesta,et al.  PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING , 2011, Probability in the Engineering and Informational Sciences.

[3]  Aditya Mahajan,et al.  Multi‐Armed Bandits, Gittins Index, and its Calculation , 2014 .

[4]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

[5]  Alan Scheller-Wolf,et al.  SOAP: One Clean Analysis of All Age-Based Scheduling Policies , 2018, SIGMETRICS 2018.

[6]  Linus Schrage,et al.  The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..

[7]  Gideon Weiss,et al.  Four proofs of Gittins’ multiarmed bandit theorem , 2016, Ann. Oper. Res..

[8]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

[9]  Esa Hyytiä,et al.  Minimizing slowdown in heterogeneous size-aware dispatching systems , 2012, SIGMETRICS '12.

[10]  J. Gittins.  Bandit processes and dynamic allocation indices , 1979 .

[11]  G. Weiss,et al.  On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines , 1995, Advances in Applied Probability.

[12]  Linus Schrage,et al.  The Queue M/G/1 With Feedback to Lower Priority Queues , 1967 .

[13]  Peter Winkler,et al.  On Playing Golf with Two Balls , 2003, SIAM J. Discret. Math..

[14]  Mark H. A. Davis.  Piecewise‐Deterministic Markov Processes: A General Class of Non‐Diffusion Stochastic Models , 1984 .

[15]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[16]  R. Weber.  On the Gittins Index for Multiarmed Bandits , 1992 .

[17]  Mor Harchol-Balter.  Performance Modeling and Design of Computer Systems: M/M/1 and PASTA , 2013 .

[18]  Dimitris Bertsimas,et al.  The achievable region method in the optimal control of queueing systems; formulations, bounds and policies , 1995, Queueing Syst. Theory Appl..

[19]  D. Verms.  Optimal control of piecewise deterministic markov process , 1985 .

[20]  P. Whittle.  Multi‐Armed Bandits and the Gittins Index , 1980 .

[21]  Konstantin Avrachenkov,et al.  Optimal policy for multi-class scheduling in a single server queue , 2009, 2009 21st International Teletraffic Congress.

[22]  Urtzi Ayesta,et al.  On the Gittins index in the M/G/1 queue , 2009, Queueing Syst. Theory Appl..