Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
User-Centric Performance Analysis of Market-Based Cluster Batch Schedulers
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Mechanism design for online real-time scheduling
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
Online auctions with re-usable goods
Proceedings of the 6th ACM conference on Electronic commerce
Online ascending auctions for gradually expiring items
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Addressing strategic behavior in a deployed microeconomic resource allocator
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Tycoon: An implementation of a distributed, market-based resource allocation system
Multiagent and Grid Systems
Mirage: a microeconomic resource allocation system for sensornet testbeds
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
Algorithmic Game Theory
Efficient auction-based grid reservations using dynamic programming
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
HPCC '08 Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications
Eliciting honest value information in a batch-queue environment
GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
On the importance of migration for fairness in online grid markets
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Decentralization and mechanism design for online machine scheduling
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Modeling user runtime estimates
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
CloudBay: Enabling an Online Resource Market Place for Open Clouds
UCC '12 Proceedings of the 2012 IEEE/ACM Fifth International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
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.