Minimizing the Worst Slowdown: Offline, Online

We look for protocols (service disciplines) setting an upper bound on the slowdown (expected sojourn time divided by job size) a job may face, irrespective of the processing times of other jobs. We call this worst slowdown the liability of a job. In a scheduling problem with identical release dates, allowing the server to randomize the order of service cuts almost in half the liability profiles feasible under deterministic protocols. The same is true if cash transfers are feasible and users have linear waiting costs. When release times are arbitrary, we characterize liability functions implementable by a deterministic online protocol, where the liability depends on the number of jobs in the queue upon release of the job. In an M/D/1 queue with a given arrival rate, the liability of a job is at least its slowdown when all other jobs are of the same size. We conjecture that this liability is feasible online, and identify a probabilistic protocol exceeding it by at most 130%.

[1]  Lester E. Dubins,et al.  Group Decision Devices , 1977 .

[2]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

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

[4]  Hervé Moulin,et al.  Proportional scheduling, split-proofness, and merge-proofness , 2008, Games Econ. Behav..

[5]  Adam Wierman,et al.  Competitive Analysis of M/GI/1 Queueing Policies , 2003 .

[6]  Yves Sprumont.  Ordinal Cost Sharing , 1998 .

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

[8]  Adam Wierman,et al.  Bounds on a Fair Policy with Near Optimal Performance , 2003 .

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

[10]  L. Hurwicz,et al.  Social Goals and Social Organization , 1986 .

[11]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[12]  Analysis and Simulation of a Fair Queuing Algorithm , 2008 .

[13]  Manipushpak Mitra.  Mechanism design in queueing problems , 2001 .

[14]  Theodore P. Hill,et al.  Equitable distribution of indivisible objects , 1988 .

[15]  J. Suijs.  On incentive compatibility and budget balancedness in public decision making , 1996 .

[16]  L. Shapley.  Cores of convex games , 1971 .

[17]  Maurice Queyranne,et al.  Structure of a simple scheduling polyhedron , 1993, Math. Program..

[18]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[19]  H. Moulin.  Welfare bounds in the cooperative production problem , 1992 .

[20]  H. Moulin.  Welfare bounds in the fair division problem , 1991 .

[21]  François Maniquet,et al.  A characterization of the Shapley value in queueing problems , 2003, J. Econ. Theory.

[22]  H. Moulin.  Uniform externalities: Two axioms for fair allocation , 1990 .

[23]  H. Varian,et al.  Theories of Justice Based on Symmetry , 1984 .

[24]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[25]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .