Dominant Resource Fairness: Fair Allocation of Multiple Resource Types
暂无分享,去创建一个
Benjamin Hindman | Scott Shenker | Ali Ghodsi | Ion Stoica | Matei Zaharia | Andy Konwinski | M. Zaharia | I. Stoica | Benjamin Hindman | A. Konwinski | S. Shenker | A. Ghodsi
[1] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[2] D. Foley. Resource allocation and the public sector , 1967 .
[3] A. Sen,et al. Rawls versus Bentham: An axiomatic examination of the pure distribution problem , 1974 .
[4] H. Varian. Equity, Envy and Efficiency , 1974 .
[5] Ashok K. Agrawala,et al. Models of memory scheduling , 1975, SOSP.
[6] E. Kalai,et al. OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .
[7] Elisha A. Pazner,et al. Egalitarian Equivalent Allocations: A New Concept of Economic Equity , 1978 .
[8] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[9] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.
[10] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[11] Sanjoy K. Baruah,et al. Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.
[12] H. Peyton Young,et al. Equity - in theory and practice , 1994 .
[13] William E. Weihl,et al. Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.
[14] Carl A. Waldspurger,et al. Lottery and stride scheduling: flexible proportional-share resource management , 1995 .
[15] Sanjoy K. Baruah,et al. Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.
[16] QueueingJon,et al. WF 2 Q : Worst-case Fair Weighted Fair , 1996 .
[17] George Varghese,et al. Efficient fair queueing using deficit round-robin , 1996, TNET.
[18] Hui Zhang,et al. WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[19] H. Vin,et al. Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.
[20] Hussein M. Abdel-Wahab,et al. A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.
[21] Harrick M. Vin,et al. Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1997, TNET.
[22] Scott Shenker,et al. Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.
[23] Yuval Rabani,et al. Fairness in routing and load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[24] Banu Özden,et al. Fair queuing for aggregated multiple links , 2001, SIGCOMM.
[25] Rami G. Melhem,et al. Multiple-resource periodic scheduling problem: how much fairness is necessary? , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.
[26] Hervé Moulin,et al. Fair division and collective welfare , 2003 .
[27] Edward W. Knightly,et al. Opportunistic fair scheduling over multiple wireless channels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[28] Jason Nieh,et al. Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems , 2005, USENIX Annual Technical Conference, General Track.
[29] Yuan Yu,et al. Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.
[30] Andrew V. Goldberg,et al. Quincy: fair scheduling for distributed computing clusters , 2009, SOSP '09.
[31] Scott Shenker,et al. Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling , 2010, EuroSys '10.
[32] Randy H. Katz,et al. Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center , 2011, NSDI.