Dominant resource fairness: Fair allocation of multiple resource types

Proceedings of NSDI 2011: 8th USENIX Symposium on Networked Systems Design and Implementation

Volumn , Issue , 2011, Pages 323-336

  Ghodsi, Ali ^a   Zaharia, Matei ^a   Hindman, Benjamin ^a   Konwinski, Andy ^a   Shenker, Scott ^a   Stoica, Ion ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARETO PRINCIPLE;

FAIR ALLOCATION; FAIR RESOURCE ALLOCATION; FAIR SHARING; IS STRATEGY; MAX-MIN FAIRNESS; MULTIPLE RESOURCES; PARETO-EFFICIENT; RESOURCE MANAGERS;

SYSTEMS ANALYSIS;

EID: 85043238089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Hadoop Capacity Scheduler. http://hadoop.apache.org/common/docs/r0.20.2/capacity-scheduler.html.
2. Hadoop Fair Scheduler. http://hadoop.apache.org/common/docs/r0.20.2/fair-scheduler.html.
3. Personal communication with Hervé Moulin.
4. A. K. Agrawala and R. M. Bryant. Models of memory scheduling. In SOSP '75, 1975.
5. J. Axboe. Linux Block IO -Present and Future (Completely Fair Queueing). In Ottawa Linux Symposium 2004, pages 51-61, 2004.
6. S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6):600-625, 1996.
7. S. K. Baruah, J. Gehrke, and C. G. Plaxton. Fast scheduling of periodic tasks on multiple resources. In IPPS '95, 1995.
8. 2Q: Worst-case fair weighted fair queueing. In INFOCOM, 1996.
9. D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, second edition, 1992.
10. J. M. Blanquer and B. Özden. Fair queuing for aggregated multiple links. SIGCOMM '01, 31(4):189-197, 2001.
11. B. Caprita, W. C. Chan, J. Nieh, C. Stein, and H. Zheng. Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor systems. In USENIX Annual Technical Conference, 2005.
12. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In SIGCOMM '89, pages 1-12, New York, NY, USA, 1989. ACM.
13. D. Foley. Resource allocation and the public sector. Yale Economic Essays, 7(1):73-76, 1967.
14. A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker, and I. Stoica. Dominant resource fairness: Fair allocation of multiple resource types. Technical Report UCB/EECS-2011-18, EECS Department, University of California, Berkeley, Mar 2011.
15. P. Goyal, H. Vin, and H. Cheng. Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks. IEEE/ACM Transactions on Networking, 5(5):690-704, Oct. 1997.
16. B. Hindman, A. Konwinski, M. Zaharia, A. Ghodsi, A. D. Joseph, R. H. Katz, S. Shenker, and I. Stoica. Mesos: A platform for fine-grained resource sharing in the data center. In NSDI, 2011.
17. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In EuroSys 07, 2007.
18. M. Isard, V. Prabhakaran, J. Currey, U. Wieder, K. Talwar, and A. Goldberg. Quincy: Fair scheduling for distributed computing clusters. In SOSP '09, 2009.
19. E. Kalai and M. Smorodinsky. Other Solutions to Nash's Bargaining Problem. Econometrica, 43(3):513-518, 1975.
20. J. M. Kleinberg, Y. Rabani, and É. Tardos. Fairness in routing and load balancing. J. Comput. Syst. Sci., 63(1):2-20, 2001.
21. Y. Liu and E. W. Knightly. Opportunistic fair scheduling over multiple wireless channels. In INFOCOM, 2003.
22. H. Moulin. Fair Division and Collective Welfare. The MIT Press, 2004.
23. J. Nash. The Bargaining Problem. Econometrica, 18(2):155-162, April 1950.
24. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control - the single node case. ACM/IEEE Transactions on Networking, 1(3):344-357, June 1993.
25. E. A. Pazner and D. Schmeidler. Egalitarian equivalent allocations: A new concept of economic equity. Quarterly Journal of Economics, 92:671-687, 1978.
26. A. Sen. Rawls Versus Bentham: An Axiomatic Examination of the Pure Distribution Problem. Theory and Decision, 4(1):301-309, 1974.
27. M. Shreedhar and G. Varghese. Efficient fair queuing using deficit round robin. IEEE Trans. Net, 1996.
28. I. Stoica, H. Abdel-Wahab, K. Jeffay, S. Baruah, J. Gehrke, and G. Plaxton. A proportional share resource allocation algorithm for real-time, time-shared systems. In IEEE RTSS 96, 1996.
29. I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks. In SIGCOMM, 1998.
30. H. Varian. Equity, envy, and efficiency. Journal of Economic Theory, 9(1):63-91, 1974.
31. C. A. Waldspurger. Lottery and Stride Scheduling: Flexible Proportional Share Resource Management. PhD thesis, MIT, Laboratory of Computer Science, Sept. 1995. MIT/LCS/TR-667.
32. C. A. Waldspurger and W. E. Weihl. Lottery scheduling: flexible proportional-share resource management. In OSDI '94, 1994.
33. H. P. Young. Equity: in theory and practice. Princeton University Press, 1994.
34. M. Zaharia, D. Borthakur, J. Sen Sarma, K. Elmeleegy, S. Shenker, and I. Stoica. Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling. In EuroSys 10, 2010.
35. D. Zhu, D. Mossé, and R. G. Melhem. Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary? In IEEE RTSS, 2003.