Modeling, scheduling, and simulation of switched processing systems

Switched Processing Systems (SPS) serve as canonical models in a wide area of applications such as high performance computing, wireless networking, call centers, and flexible manufacturing. In this article, we model the SPS by considering both slotted and continuous time and analyze it under fairly mild stochastic assumptions. Two classes of scheduling policies are introduced and shown to maximize the throughput and maintain strong stability of the system. In addition, their performance with respect to the average job sojourn time is examined by simulating small SPS subject to different types of input traffic. By utilizing the simulation result of the proposed policies, a hybrid control policy is constructed to reduce the average job sojourn time when the system has unknown and changing input loads.

[1]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[2]  B. Hajek.  Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.

[3]  Félix Hernández-Campos,et al.  Queueing analysis of network traffic: methodology and visualization tools , 2005, Comput. Networks.

[4]  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.

[5]  Marco Ajmone Marsan,et al.  On the stability of input-queued switches with speed-up , 2001, TNET.

[6]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[7]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

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

[9]  J. G. Dai,et al.  Maximum Pressure Policies in Stochastic Processing Networks , 2005, Oper. Res..

[10]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[11]  R. Pemantle,et al.  Moment conditions for a sequence with negative drift to be uniformly bounded in Lr , 1999, math/0404093.

[12]  Harold J. Kushner,et al.  Approximation and Weak Convergence Methods for Random Processes , 1984 .

[13]  Sean P. Meyn,et al.  Stability and convergence of moments for multiclass queueing networks via fluid limit models , 1995, IEEE Trans. Autom. Control..

[14]  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).

[15]  Jean C. Walrand,et al.  An introduction to queueing networks , 1989, Prentice Hall International editions.

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

[17]  H. Kushner,et al.  Stochastic Approximation and Recursive Algorithms and Applications , 2003 .

[18]  W. Grassman.  Approximation and Weak Convergence Methods for Random Processes with Applications to Stochastic Systems Theory (Harold J. Kushner) , 1986 .

[19]  J. Banks,et al.  Discrete-Event System Simulation , 1995 .

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

[21]  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.

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

[23]  A. Stolyar.  Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality , 2003 .

[24]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[25]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

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