A Game-Theoretic Analysis of Shared/Buy-in Computing Systems

High performance computing clusters are increasingly operating under a shared/buy-in paradigm. Under this paradigm, users choose between two tiers of services: shared services and buy-in services. Shared services provide users with access to shared resources for free, while buy-in services allow users to purchase additional buy-in resources in order to shorten job completion time. An important feature of shared/buy-in computing systems consists of making unused buy-in resources available to all other users of the system. Such a feature has been shown to enhance the utilization of resources. Alongside, it creates strategic interactions among users, hence giving rise to a non-cooperative game at the system level. Specifically, each user is faced with the questions of whether to purchase buy-in resources, and if so, how much to pay for them. Under quite general conditions, we establish that a shared/buy-in computing game yields a unique Nash equilibrium, which can be computed in polynomial time. We provide an algorithm for this purpose, which can be implemented in a distributed manner. Moreover, by establishing a connection to the theory of aggregative games, we prove that the game converges to the Nash equilibrium through best response dynamics from any initial state. We justify the underlying game-theoretic assumptions of our model using real data from a computing cluster, and conduct numerical simulations to further explore convergence properties and the influence of system parameters on the Nash equilibrium. In particular, we point out potential unfairness and abuse issues and discuss solution venues.

[1]  D. M. Topkis Equilibrium Points in Nonzero-Sum n-Person Submodular Games , 1979 .

[2]  Azer Bestavros,et al.  A case study of a shared/buy-in computing ecosystem , 2018, Cluster Computing.

[3]  Shie Mannor,et al.  Strategic Formation of Heterogeneous Networks , 2016, IEEE Journal on Selected Areas in Communications.

[4]  Danny Dolev,et al.  Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation , 2006, PODC '06.

[5]  Mark Voorneveld,et al.  Best-response potential games , 2000 .

[6]  Quanyan Zhu,et al.  Game theory meets network security and privacy , 2013, CSUR.

[7]  Pradeep Dubey,et al.  Strategic complements and substitutes, and potential games , 2006, Games Econ. Behav..

[8]  Jonathan Levin,et al.  Supermodular Games , 2003 .

[9]  Ian A. Kash,et al.  Fixed and market pricing for cloud services , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[10]  Ariel Orda,et al.  Workload Factoring: A Game-Theoretic Perspective , 2015, IEEE/ACM Transactions on Networking.

[11]  J. Goodman Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

[12]  Eitan Altman,et al.  S-modular games and power control in wireless networks , 2003, IEEE Trans. Autom. Control..

[13]  M. K. Jensen Aggregative games and best-reply potentials , 2010 .

[14]  R. Cornes,et al.  Aggregative Public Good Games , 2006 .

[15]  Luis C. Corchón Comparative statics for aggregative games the strong concavity case , 1994 .

[16]  David Starobinski,et al.  Competition in Private Commons: Price War or Market Sharing? , 2016, IEEE/ACM Transactions on Networking.

[17]  K M Søndergaard,et al.  [Understanding statistics?]. , 1995, Ugeskrift for laeger.

[18]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[19]  Claudio Mezzetti,et al.  Better-reply dynamics and global convergence to Nash equilibrium in aggregative games , 2006, Games Econ. Behav..

[20]  Zhu Han,et al.  Resource Management in Cloud Networking Using Economic Analysis and Pricing Models: A Survey , 2017, IEEE Communications Surveys & Tutorials.

[21]  W. Marsden I and J , 2012 .

[22]  Richard Cornes,et al.  Aggregative Environmental Games , 2016 .

[23]  Michael L. Honig,et al.  Distributed interference compensation for wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[24]  E. Abt Understanding statistics 3 , 2010, Evidence-Based Dentistry.

[25]  Azer Bestavros,et al.  Colocation Games and Their Application to Distributed Resource Management , 2009, HotCloud.

[26]  Dusit Niyato,et al.  Dynamics of Network Selection in Heterogeneous Wireless Networks: An Evolutionary Game Approach , 2009, IEEE Transactions on Vehicular Technology.

[27]  David Starobinski,et al.  Advance Reservation Games , 2017, ACM Trans. Model. Perform. Evaluation Comput. Syst..

[28]  Mariacarla Calzarossa,et al.  Workload Characterization Issues and Methodologies , 2000, Performance Evaluation.

[29]  Sheng Di,et al.  Characterization and Comparison of Cloud versus Grid Workloads , 2012, 2012 IEEE International Conference on Cluster Computing.