
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michal Feldman, Kevin Lai, Li Zhang, "The ProportionalShare Allocation Market for Computational Resources," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 8, pp. 10751088, August, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.168, author = {Michal Feldman and Kevin Lai and Li Zhang}, title = {The ProportionalShare Allocation Market for Computational Resources}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {8}, issn = {10459219}, year = {2009}, pages = {10751088}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.168}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  The ProportionalShare Allocation Market for Computational Resources IS  8 SN  10459219 SP1075 EP1088 EPD  10751088 A1  Michal Feldman, A1  Kevin Lai, A1  Li Zhang, PY  2009 KW  Game theory KW  resource allocation KW  proportionalshare mechanism. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] Tycoon, http:/tycoon.hpl.hp.com, Aug. 2008.
[2] A. AuYoung, B.N. Chun, A.C. Snoeren, and A. Vahdat, “Resource Allocation in Federated Distributed Computing Infrastructures,” Proc. First Workshop Operating System and Architectural Support for the OnDemand IT Infrastructure (OASIS), 2004.
[3] A. Bavier, M. Bowman, B. Chun, D. Culler, S. Karlin, S. Muir, L. Peterson, T. Roscoe, T. Spalink, and M. Wawrzoniak, “Operating System Support for PlanetaryScale Network Services,” Proc.First Symp. Networked Systems Design and Implementation (NSDI '04), pp.253266, 2004.
[4] W. Brainard and H. Scarf, “How to Compute Equilibrium Prices in 1891,” Cowles Foundation Discussion Paper, p. 1270, 2000.
[5] B.N. Chun and D.E. Culler, “MarketBased Proportional Resource Sharing for Clusters,” Technical Report CSD1092, Computer Science Division, Univ. of California at Berkeley, Jan. 2000.
[6] B. Dragovic, K. Fraser, S. Hand, T. Harris, A. Ho, I. Pratt, A. Warfield, P. Barham, and R. Neugebauer, “Xen and the Art of Virtualization,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 164177, 2003.
[7] E. Eisenberg and D. Gale, “Consensus of Subjective Probabilities: The PariMutuel Method,” Annals of Math. Statistics, vol. 30, pp.165168, 1959.
[8] D. Ferguson, Y. Yemini, and C. Nikolaou, “Microeconomic Algorithms for Load Balancing in Distributed Computer Systems,” Proc. Eighth Int'l Conf. Distributed Computing Systems (ICDCS '88), pp. 491499, 1988.
[9] I. Foster, C. Kesselman, G. Tsudik, and S. Tuecke, “A Security Architecture for Computational Grids,” Proc. First ACM Conf. Computer and Comm. Security (CCS '98), pp. 8392, 1998.
[10] B. Hajek and S. Yang, Strategic Buyers in a Sum Bid Game for Flat Networks, Manuscript, http://tesla.csl.uiuc.edu/~hajek/PapersHajekYang.pdf , 2004.
[11] R. Johari and J.N. Tsitsiklis, “Efficiency Loss in a Network Resource Allocation Game,” Math. Operations Research, vol. 29, pp.407435, 2004, 1959.
[12] F.P. Kelly, “Charging and Rate Control for Elastic Traffic,” European Trans. Telecomm., vol. 8, pp. 3337, 1997.
[13] F.P. Kelly and A.K. Maulloo, “Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability,” Operational Research Soc., vol. 49, pp. 237252, 1998.
[14] E. Koutsoupias and C. Papadimitriou, “WorstCase Equilibria,” Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science (STAC'99), pp. 404413, 1999.
[15] H.W. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly, vol. 2, pp. 8397, 1955.
[16] K. Lai, L. Rasmusson, E. Adar, S. Sorkin, L. Zhang, and B.A. Huberman, “Tycoon: An Implementation of a Distributed MarketBased Resource Allocation System,” Multiagent and Grid Systems, vol. 1, no. 3, pp. 169182, Aug. 2005.
[17] I. Milchtaich, “Congestion Games with PlayerSpecific Payoff Functions,” Games and Economic Behavior, vol. 13, pp. 111124, 1996.
[18] D. Monderer and L.S. Shapley, “Potential Games,” Games and Economic Behavior, vol. 14, pp. 124143, 1996.
[19] J. Nieh, C. Vaill, and H. Zhong, “VirtualTime RoundRobin: An O(1) Proportional Share Scheduler,” Proc. USENIX Ann. Technical Conf., pp. 245259, 2001.
[20] C.H. Papadimitriou, “Algorithms, Games, and the Internet,” Proc. 33rd ACM Symp. Theory of Computing (STOC '01), pp. 749753, 2001.
[21] J. Regehr, “Some Guidelines for Proportional Share CPU Scheduling in GeneralPurpose Operating Systems,” Work in Progress Session of the Proc. IEEE RealTime Systems Symp. (RTSS '01), Dec. 2001.
[22] O. Regev and N. Nisan, “The Popcorn Market: Online Markets for Computational Resources,” Proc. First Int'l Conf. Information and Computational Economies (ICE '98), pp. 148157, 1998.
[23] P.J. Reny, “On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games,” Econometrica, vol. 67, no. 5, pp. 10291056, 1999.
[24] J.B. Rosen, “Existence and Uniqueness of Equilibrium Points for Concave NPerson Games,” Econometrica, vol. 33, no. 3, pp.520534, 1965.
[25] R.W. Rosenthal, “A Class of Games Possessing PureStrategy Nash Equilibria,” Int'l J. Game Theory, vol. 2, pp. 6567, 1973.
[26] S. Sanghavi and B. Hajek, Optimal Allocation of a Divisible Good to Strategic Buyers, http://tesla.csl.uiuc.edu/~hajek/PapersOptDivisible.pdf , 2004.
[27] L. Shapley and M. Shubik, “Trade Using One Commodity as a Means of Payment,” J. Political Economy, vol. 85, pp. 937968, 1977.
[28] I. Stoica, H. AbdelWahab, K. Jeffay, S. Baruah, J. Gehrke, and G.C. Plaxton, “A Proportional Share Resource Allocation Algorithm for RealTime, TimeShared Systems,” Proc. IEEE RealTime Systems Symp. (RTSS '96), pp. 288299, 1996.
[29] H.R. Varian, “Equity, Envy, and Efficiency,” J. Economic Theory, vol. 9, pp. 6391, 1974.
[30] C.A. Waldspurger, T. Hogg, B.A. Huberman, J.O. Kephart, and W.S. Stornetta, “Spawn: A Distributed Computational Economy,” Software Eng., vol. 18, no. 2, pp. 103117, 1992.
[31] C.A. Waldspurger and W.E. Weihl, “Lottery Scheduling: Flexible ProportionalShare Resource Management,” Operating Systems Design and Implementation, pp. 111, 1994.
[32] M.P. Wellman, W.E. Walsh, P.R. Wurman, and J.K. MacKieMason, “Auction Protocols for Decentralized Scheduling,” Games and Economic Behavior, vol. 35, pp. 271303, 2001.
[33] L. Zhang, “The Efficiency and Fairness of a Fixed Budget Resource Allocation Game,” Proc. 32nd Int'l Colloquium on Automata, Languages and Programming (ICALP '05), pp. 485496, 2005.