Minimizing the worst slowdown: Offline, online

Operations Research

Volumn 55, Issue 5, 2007, Pages 876-889

  Moulin, Hervé ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

Probabilistic protocols; Queueing; Scheduling; Slowdown

Indexed keywords

DETERMINISTIC PROTOCOLS; PROBABILISTIC PROTOCOLS;

NETWORK PROTOCOLS; PROBABILISTIC LOGICS; PROBLEM SOLVING; QUEUEING NETWORKS; SCHEDULING;

ONLINE SYSTEMS;

EID: 34948904690     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0447     Document Type: Article

References (26)

1. Bansal, N., M. Harchol-Balter. 2001. Analysis of SRPT scheduling: Investigating unfairness. Proc. ACM SIGMETRICS. ACM Press, New York, 279-290.
2. Bansal, N., A. Wierman. 2002. Competitive analysis of M/GI/1 queueing policies. Mimeo, Carnegie Mellon University, Pittsburgh, PA.
3. Bender, M., S. Chakrabarti, S. Muthukrishnan. 1998. Flow and stretch metrics for scheduling continuous job streams. Proc. 9th ACM-SIAM Sympos. Discrete Algorithms. SIAM Press, Philadelphia, PA, 270-279.
4. Chun, Y. 2004. Consistency and monotonicity in sequencing problems. Mimeo, Seoul National University, Seoul, South Korea.
5. Demers, A., S. Keshav, S. Shenker. 1990. Analysis and simulation of a fair queuing algorithm. Internetworking: Res. Experience 1 3-26.
6. Demko, S., T Hill. 1988. Equitable distribution of indivisible objects. Math. Soc. Sci. 16(2) 145-158.
7. Dubins, L. F. 1977. Group decision devices. Amer. Math Monthly 84(May) 350-356.
8. Friedman, E. J., S. G. Henderson. 2003. Fairness and efficiency in Web server protocols. Proc. 2003 ACM SIGMETRICS Internat. Conf. Measurement Model. Comput. Systems. ACM Press, New York, 229-237.
9. Friedman, E. J., S. G. Henderson, G. Hurley. 2004. Minimizing mean response time subject to fairness. Mimeo, Cornell University, Ithaca, NY.
10. Harchol-Balter, M., N. Bansal, B. Schroeder, M. Agrawal. 2001. Size-based scheduling to improve Web performance. Mimeo, Carnegie Mellon University, Pittsburgh, PA.
11. Maniquet, F. 2003. A characterization of the Shapley value in queueing problems. J. Econom. Theory 109(1) 90-103.
12. Mitra, M. 2001. Mechanism design in queueing problems. Econom. Theory 17 277-305.
13. Moulin, H. 1990. Uniform externalities: Two axioms for fair allocation. J. Public Econom. 43(3) 305-326.
14. Moulin, H. 1991. Welfare bounds in the fair division problem. J. Econom. Theory 54(2) 321-337.
15. Moulin, H. 1992. Welfare bounds in the cooperative production problem. Games Econom. Behav. 4 373-401.
16. Moulin, H. 2004. Proportional scheduling, split-proofness and mergeproofness. Mimeo, Rice University, Houston, TX.
17. Queyranne, M. 1993. Structure of a simple scheduling polyhedron. Math. Programming 58 263-285.
18. Shapley, L. 1971. Core of convex games. Internat. J. Game Theory 1 11-26.
19. Smith, W 1956. Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 59-66.
20. Sprumont, Y. 1998. Ordinal cost sharing. J. Econom. Theory 81 126-162.
21. Suijs, J. 1996. On incentive compatibility and budget balancedness in public decision making. Econom. Design 2 193-209.
22. Thomson, W., H. Varian. 1985. Theories of justice based on symmetry. L. Hurwicz, D. Schmeidler, H. Sonnenschein, eds. Social Goals and Social Organizations. Cambridge University Press, Cambridge, UK, 107-129.
23. Wierman, A., M. Harchol-Balter. 2003a. Bounds on a fair policy with near optimal performance. Mimeo, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA.
24. Wierman, A., M. Harchol-Balter. 2003b. Classifying scheduling policies with respect to unfairness in an M/GI/1. Proc. ACM SIGMETRICS Conf Measurement Model. Comput. Systems.
25. Wolff, R. W. 1989. Stochastic Modeling and the Theory of Queues. Prentice-Hall Series in Industrial and Systems Engineering. Prentice-Hall, Englewood Cliffs, NJ.
26. Wolsey, L. A. 1985. Mixed integer programming formulations for production planning and scheduling problems. 12th Internat. Sympos. Math. Programming. SIAM Press, Philadelphia, PA.