CWS: a model-driven scheduling policy for correlated workloads

We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs based on the structure of correlations and on the outcome of past scheduling decisions. Size prediction is achieved using a class of Hidden Markov Models (HMM) with continuous observation densities that describe job sizes. We show how the forward-backward algorithm of HMMs applies effectively in scheduling applications and how it can be used to derive closed-form expressions for size prediction. This is particularly simple to implement in the case of observation densities that are phase-type (PH-type) distributed, where existing fitting methods for Markovian point processes may also simplify the parameterization of the HMM workload model. Based on the job size predictions, CWS emulates size-based policies which favor short jobs, with accuracy depending mainly on the HMM used to parametrize the scheduling algorithm. Extensive simulation and analysis illustrate that CWS is competitive with policies that assume exact information about the workload.

[1]  Alma Riska,et al.  Long-Range Dependence at the Disk Drive Level , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[2]  San-qi Li,et al.  Performance impacts of self-similarity in traffic , 1995, SIGMETRICS '95/PERFORMANCE '95.

[3]  Predrag R. Jelenkovic,et al.  Adaptive and scalable comparison scheduling , 2007, SIGMETRICS '07.

[4]  Xiaohong Yuan,et al.  Modeling of traffic sources in ATM networks , 2002, Proceedings IEEE SoutheastCon 2002 (Cat. No.02CH37283).

[5]  Sem C. Borst,et al.  The impact of the service discipline on delay asymptotics , 2003, Perform. Evaluation.

[6]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[7]  William S. Lovejoy,et al.  Computationally Feasible Bounds for Partially Observed Markov Decision Processes , 1991, Oper. Res..

[8]  José R. Correa,et al.  Single-Machine Scheduling with Precedence Constraints , 2005, Math. Oper. Res..

[9]  Takahiro Hara,et al.  Scheduling correlated broadcast data considering access frequencies with temporal variations , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[10]  Adam Wierman,et al.  Classifying scheduling policies with respect to unfairness in an M/GI/1 , 2003, SIGMETRICS '03.

[11]  Vishal Misra,et al.  PBS: a unified priority-based scheduler , 2007, SIGMETRICS '07.

[12]  Adam Wierman,et al.  Scheduling despite inexact job-size information , 2008, SIGMETRICS '08.

[13]  Eric J. Friedman,et al.  Fairness and efficiency in web server protocols , 2003, SIGMETRICS '03.

[14]  D. Sorensen Numerical methods for large eigenvalue problems , 2002, Acta Numerica.

[15]  Armin Heindl Traffic based decomposition of general queueing networks with correlated input processes , 2001 .

[16]  Aurel A. Lazar,et al.  Modeling video sources for real-time scheduling , 2005, Multimedia Systems.

[17]  Kevin D. Glazebrook,et al.  Single machine scheduling when processing times are correlated normal random variables , 1997 .

[18]  Bo Friis Nielsen,et al.  A Markovian approach for modeling packet traffic with long-range dependence , 1998, IEEE J. Sel. Areas Commun..

[19]  Lawrence R. Rabiner,et al.  A tutorial on Hidden Markov Models , 1986 .

[20]  Xiliang Zhong,et al.  Energy-aware modeling and scheduling of real-time tasks for dynamic voltage scaling , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[21]  Rolf H. Möhring,et al.  Approximation in stochastic scheduling: the power of LP-based priority policies , 1999, JACM.

[22]  ScharbrodtMark,et al.  A new average case analysis for completion time scheduling , 2006 .

[23]  B. Melamed,et al.  The transition and autocorrelation structure of tes processes: Part II: Special Cases , 1992 .

[24]  Randolph D. Nelson,et al.  The mathematics of product form queuing networks , 1993, CSUR.