The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2009 vol.20)
pp: 1075-1088
Michal Feldman , Hebrew University of Jerusalem, Jerusalem
Kevin Lai , Hewlett-Packard Laboratories, Palo Alto
Li Zhang , Microsoft Research Silicon Valley, Mountain View
ABSTRACT
We study the problem of allocating shared resources, such as bandwidth in computer networks and computational resources in shared clusters, among multiple users by the proportional-share market mechanism. Under this mechanism, each user partitions his budget among the multiple resources and receives a fraction of each resource proportional to his bid. We first formulate the resource allocation game under the proportional-share mechanism and study the efficiency and fairness of the equilibrium in this game. We present analytic and simulation results demonstrating that the proportional-share mechanism achieves a reasonable balance of high degrees of efficiency and fairness at the equilibrium.
INDEX TERMS
Game theory, resource allocation, proportional-share mechanism.
CITATION
Michal Feldman, Kevin Lai, Li Zhang, "The Proportional-Share Allocation Market for Computational Resources", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 8, pp. 1075-1088, August 2009, doi:10.1109/TPDS.2008.168
REFERENCES
[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 On-Demand 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 Planetary-Scale Network Services,” Proc.First Symp. Networked Systems Design and Implementation (NSDI '04), pp.253-266, 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, “Market-Based Proportional Resource Sharing for Clusters,” Technical Report CSD-1092, 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. 164-177, 2003.
[7] E. Eisenberg and D. Gale, “Consensus of Subjective Probabilities: The Pari-Mutuel Method,” Annals of Math. Statistics, vol. 30, pp.165-168, 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. 491-499, 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. 83-92, 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.407-435, 2004, 1959.
[12] F.P. Kelly, “Charging and Rate Control for Elastic Traffic,” European Trans. Telecomm., vol. 8, pp. 33-37, 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. 237-252, 1998.
[14] E. Koutsoupias and C. Papadimitriou, “Worst-Case Equilibria,” Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science (STAC'99), pp. 404-413, 1999.
[15] H.W. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.
[16] K. Lai, L. Rasmusson, E. Adar, S. Sorkin, L. Zhang, and B.A. Huberman, “Tycoon: An Implementation of a Distributed Market-Based Resource Allocation System,” Multiagent and Grid Systems, vol. 1, no. 3, pp. 169-182, Aug. 2005.
[17] I. Milchtaich, “Congestion Games with Player-Specific Payoff Functions,” Games and Economic Behavior, vol. 13, pp. 111-124, 1996.
[18] D. Monderer and L.S. Shapley, “Potential Games,” Games and Economic Behavior, vol. 14, pp. 124-143, 1996.
[19] J. Nieh, C. Vaill, and H. Zhong, “Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler,” Proc. USENIX Ann. Technical Conf., pp. 245-259, 2001.
[20] C.H. Papadimitriou, “Algorithms, Games, and the Internet,” Proc. 33rd ACM Symp. Theory of Computing (STOC '01), pp. 749-753, 2001.
[21] J. Regehr, “Some Guidelines for Proportional Share CPU Scheduling in General-Purpose Operating Systems,” Work in Progress Session of the Proc. IEEE Real-Time 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. 148-157, 1998.
[23] P.J. Reny, “On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games,” Econometrica, vol. 67, no. 5, pp. 1029-1056, 1999.
[24] J.B. Rosen, “Existence and Uniqueness of Equilibrium Points for Concave N-Person Games,” Econometrica, vol. 33, no. 3, pp.520-534, 1965.
[25] R.W. Rosenthal, “A Class of Games Possessing Pure-Strategy Nash Equilibria,” Int'l J. Game Theory, vol. 2, pp. 65-67, 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. 937-968, 1977.
[28] I. Stoica, H. Abdel-Wahab, K. Jeffay, S. Baruah, J. Gehrke, and G.C. Plaxton, “A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems,” Proc. IEEE Real-Time Systems Symp. (RTSS '96), pp. 288-299, 1996.
[29] H.R. Varian, “Equity, Envy, and Efficiency,” J. Economic Theory, vol. 9, pp. 63-91, 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. 103-117, 1992.
[31] C.A. Waldspurger and W.E. Weihl, “Lottery Scheduling: Flexible Proportional-Share Resource Management,” Operating Systems Design and Implementation, pp. 1-11, 1994.
[32] M.P. Wellman, W.E. Walsh, P.R. Wurman, and J.K. MacKie-Mason, “Auction Protocols for Decentralized Scheduling,” Games and Economic Behavior, vol. 35, pp. 271-303, 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. 485-496, 2005.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool