Scheduling in polling systems

We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling systems. It illustrates that a large class of scheduling policies behaves similarly in the exhaustive polling model and the standard M/GI/1 model, whereas scheduling policies in the gated polling model behave very differently than in an M/GI/1.

[1]  Guillaume Urvoy-Keller,et al.  Performance analysis of LAS-based scheduling disciplines in a packet switched network , 2004, SIGMETRICS '04/Performance '04.

[2]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[3]  Hideaki Takagi,et al.  Stochastic Analysis of Computer and Communication Systems , 1990 .

[4]  Guillaume Urvoy-Keller,et al.  Performance Models for LAS-based Scheduling Disciplines in a Packet Switched Network , 2004 .

[5]  Ivo J. B. F. Adan,et al.  Mean value analysis for polling systems , 2006, Queueing Syst. Theory Appl..

[6]  P. Franken,et al.  Queues and Point Processes , 1983 .

[7]  Erik M. M. Winands,et al.  Iterative approximation of k-limited polling systems , 2007, Queueing Syst. Theory Appl..

[8]  Guillaume Urvoy-Keller,et al.  Analysis of LAS scheduling for job size distributions with high variance , 2003, SIGMETRICS '03.

[9]  Nikhil Bansal,et al.  Handling load with less stress , 2006, Queueing Syst. Theory Appl..

[10]  Ajay D. Kshemkalyani,et al.  SWIFT: scheduling in web servers for fast response time , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[11]  Mor Harchol-Balter,et al.  Implementation of SRPT Scheduling in Web Servers , 2000 .

[12]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

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

[14]  Onno Boxma,et al.  Dynamic server assignment in a two-queue model , 1995 .

[15]  Mor Harchol-Balter,et al.  Size-based scheduling to improve web performance , 2003, TOCS.

[16]  C. Mack,et al.  THE EFFICIENCY OF N MACHINES UNI-DIRECTIONALLY PATROLLED BY ONE OPERATIVE WHEN WALKING TIME AND REPAIR TIMES ARE CONSTANTS , 1957 .

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

[18]  Hanoch Levy,et al.  Efficient Visit Orders for Polling Systems , 1993, Perform. Evaluation.

[19]  M. Yu.  The M / G / 1 processor-sharing model : transient behavior , 2022 .

[20]  L. Fournier,et al.  Expected waiting times in polling systems under priority disciplines , 1991, Queueing Syst. Theory Appl..

[21]  Izhak Rubin,et al.  Mean delay analysis for a message priority-based polling scheme , 1992, Queueing Syst. Theory Appl..

[22]  Adam Wierman,et al.  Nearly insensitive bounds on SMART scheduling , 2005, SIGMETRICS '05.

[23]  J. O..  Efficient visit frequencies for polling tables : minimization of waiting cost , .

[24]  C. Mack,et al.  The Efficiency of N Machines Uni‐Directionally Patrolled by One Operative When Walking Time is Constant and Repair Times are Variable , 1957 .

[25]  J. Shanthikumar,et al.  On extremal service disciplines in single-stage queueing systems , 1990, Journal of Applied Probability.

[26]  B. K. Kumar,et al.  Pseudo-Conservation Law for a Priority Polling System with Mixed Service Strategies , 1995, Perform. Evaluation.

[27]  Hideaki Takagi,et al.  Queueing analysis of polling models: progress in 1990-1994 , 1998 .

[28]  Yoshitaka Takahashi,et al.  A note on the pseudo-conservation law for a multi-queue with local priority , 1992, Queueing Syst. Theory Appl..

[29]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[30]  V. Schmidt,et al.  Queues and Point Processes , 1983 .

[31]  Micha Hofri,et al.  On the Optimal Control of Two Queues with Server Setup Times and its Analysis , 1987, SIAM J. Comput..

[32]  V. M. Vishnevskii,et al.  Mathematical methods to study the polling systems , 2006 .

[33]  Hideaki Takagi,et al.  Analysis and Application of Polling Models , 2000, Performance Evaluation.