PDL Abstract

SOAP: One Clean Analysis of All Age-Based Scheduling Policies

Proc. ACM Meas. Anal. Comput. Syst., Vol. 2, No. 1, Article 16. Publication date: March 2018.

Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf

Carnegie Mellon University

We consider an extremely broad class of M/G/1 scheduling policies called SOAP: Schedule Ordered by Age-based Priority. The SOAP policies include almost all scheduling policies in the literature as well as an infinite number of variants which have never been analyzed, or maybe not even conceived. SOAP policies range from classic policies, like first-come, first-serve (FCFS), foreground-background (FB), class-based priority, and shortest remaining processing time (SRPT); to much more complicated scheduling rules, such as the famously complex Gittins index policy and other policies in which a job’s priority changes arbitrarily with its age. While the response time of policies in the former category is well understood, policies in the latter category have resisted response time analysis. We present a universal analysis of all SOAP policies, deriving the mean and Laplace-Stieltjes transform of response time.