A Measurement Based Dynamic Policy for Switched Processing Systems

Switched processing systems (SPS) represent a canonical model for many areas of applications of communication, computer and manufacturing systems. They are characterized by flexible, interdependent service capabilities and multiple classes of job traffic flows. Recently, increased attention has been paid to the issue of improving quality of service (QoS) performance in terms of delays and backlogs of the associated scheduling policies, rather than simply maximizing the system's throughput. In this study, we investigate a measurement based dynamic service allocation policy that significantly improves performance with respect to delay metrics. The proposed policy solves a linear program at selected points in time that are in turn determined by a monitoring strategy that detects 'significant' changes in the intensities of the input processes. The proposed strategy is illustrated on a small SPS subject to different types of input traffic.

[1]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Nicholas Bambos,et al.  Dynamic quality of service control in packet switch scheduling , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[3]  Ilkka Nomos.  On the Use of Fractional Brownian Motion in the Theory of Connectionless Networks , 1995 .

[4]  G. Michailidis,et al.  Queueing and scheduling in random environments , 2004, Advances in Applied Probability.

[5]  George Michailidis,et al.  Optimal allocation in a queueing system with shared resources , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[6]  Nicholas Bambos,et al.  Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems , 2003, Queueing Syst. Theory Appl..

[7]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[8]  Ying-Chao Hung.  Modeling and analysis of stochastic networks with shared resources. , 2002 .

[9]  L. Tassiulas,et al.  Allocation of interdependent resources for maximal throughput , 2000 .

[10]  Nicholas Bambos,et al.  Optimal processor allocation to differentiated job flows , 2006, Perform. Evaluation.

[11]  George Michailidis,et al.  Improving quality of service for switched processing systems , 2006, 2006 11th International Workshop on Computer-Aided Modeling, Analysis and Design of Communication Links and Networks.

[12]  Nicholas Bambos,et al.  Optimizing quality of service in packet switch scheduling , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[13]  Nicholas Bambos,et al.  Local search scheduling algorithms for maximal throughput in packet switches , 2004, IEEE INFOCOM 2004.

[14]  Douglas C. Montgomery,et al.  Introduction to Statistical Quality Control , 1986 .

[15]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[16]  Nicholas Bambos,et al.  Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules , 2005, Queueing Syst. Theory Appl..

[17]  Charles W. Champ,et al.  A multivariate exponentially weighted moving average control chart , 1992 .