The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets

Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this paper we study a real system that is capable of preemptive process migration (i.e. moving jobs across nodes) and that uses a market-based resource allocation mechanism for job allocation. Specifically, we formalize our system into a market model and employ simulation-based analysis (performed on real data) to study the effects of users' behavior on performance and utility. Typically online settings are characterized by a large amount of uncertainty, therefore it is reasonable to assume that users will consider simple strategies to game the system. We thus suggest a novel approach to modeling users' behavior called the Small Risk-aggressive Group model. We show that under this model untruthful users experience degraded performance. The main result and the contribution of this paper is that using the k-th price payment scheme, which is a natural adaptation of the classical second-price scheme, discourages these users from attempting to game the market. The preemptive capability makes it possible not only to use the k-th price scheme, but also makes our scheduling algorithm superior to other non-preemptive algorithms. Finally, we design a simple one-shot game to model the interaction between the provider and the consumers. We then show (using the same simulation-based analysis) that market stability in the form of (symmetric) Nash-equilibrium is likely to be achieved in several cases.

[1]  Richard Wolski,et al.  Eliciting honest value information in a batch-queue environment , 2007, 2007 8th IEEE/ACM International Conference on Grid Computing.

[2]  Li Zhang,et al.  Tycoon: An implementation of a distributed, market-based resource allocation system , 2004, Multiagent Grid Syst..

[3]  Ryan Porter,et al.  Mechanism design for online real-time scheduling , 2004, EC '04.

[4]  Lior Amar,et al.  An organizational grid of federated MOSIX clusters , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[5]  David E. Culler,et al.  User-Centric Performance Analysis of Market-Based Cluster Batch Schedulers , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[6]  Richard Wolski,et al.  Efficient auction-based grid reservations using dynamic programming , 2008, 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis.

[7]  Chaki Ng,et al.  Mirage: a microeconomic resource allocation system for sensornet testbeds , 2005, The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II..

[8]  Dan Tsafrir,et al.  Modeling User Runtime Estimates , 2005, JSSPP.

[9]  Rudolf Müller,et al.  Decentralization and Mechanism Design for Online Machine Scheduling , 2006, SWAT.

[10]  Amin Vahdat,et al.  Addressing strategic behavior in a deployed microeconomic resource allocator , 2005, P2PECON '05.

[11]  Daniel Grosu,et al.  Combinatorial auction-based protocols for resource allocation in grids , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[12]  Mohammad Taghi Hajiaghayi,et al.  Online auctions with re-usable goods , 2005, EC '05.

[13]  J. van Leeuwen,et al.  Job Scheduling Strategies for Parallel Processing , 2003, Lecture Notes in Computer Science.

[14]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[15]  Ahuva Mu'alem,et al.  On the importance of migration for fairness in online grid markets , 2008, 2008 9th IEEE/ACM International Conference on Grid Computing.

[16]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[17]  Noam Nisan,et al.  Online ascending auctions for gradually expiring items , 2005, SODA '05.

[18]  Wayne E. Smith Various optimizers for single‐stage production , 1956 .

[19]  Andrzej Lingas,et al.  Algorithm Theory — SWAT'96 , 1996, Lecture Notes in Computer Science.

[20]  Dror G. Feitelson,et al.  Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling , 2001, IEEE Trans. Parallel Distributed Syst..