Discovering valuations and enforcing truthfulness in a deadline-aware scheduler

A cloud computing cluster equipped with a deadline-aware job scheduler faces fairness and efficiency challenges when greedy users falsely advertise the urgency of their jobs. Penalizing such untruthfulness without demotivating users from using the cloud service calls for advanced mechanism design techniques that work together with deadline-aware job scheduling. We propose a Bayesian incentive compatible pricing mechanism based on matching by replica-surrogate valuation functions. User valuations can be discovered by the mechanism, even when the users themselves do not fully understand their own valuations. Furthermore, users who are charged a Bayesian incentive compatible price have no reason to lie about the urgency of their jobs. The proposed mechanism achieves multiple desired truthful properties such as Bayesian incentive compatibility and ex-post individual rationality. We implement the proposed pricing mechanism. Through experiments in a Hadoop cluster with real-world datasets, we show that our prototype is capable of suppressing untruthful behavior from users.

[1]  Mung Chiang,et al.  Need for speed: CORA scheduler for optimizing completion-times in the cloud , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[2]  Joseph Naor,et al.  A Truthful Mechanism for Value-Based Scheduling in Cloud Computing , 2011, SAGT.

[3]  Chaitanya Swamy,et al.  Truthful and near-optimal mechanism design via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[4]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[5]  David E. Irwin,et al.  Balancing risk and reward in a market-based task service , 2004, Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004..

[6]  Daniel Grosu,et al.  A Combinatorial Auction-Based Mechanism for Dynamic VM Provisioning and Allocation in Clouds , 2013, IEEE Transactions on Cloud Computing.

[7]  Robert D. Kleinberg,et al.  Bayesian incentive compatibility via matchings , 2011, SODA '11.

[8]  Xiaohui Bei,et al.  Bayesian incentive compatibility via fractional assignments , 2010, SODA '11.

[9]  Liang Zheng,et al.  On the Viability of a Cloud Virtual Service Provider , 2016, SIGMETRICS.

[10]  Zongpeng Li,et al.  A truthful (1-ε)-optimal mechanism for on-demand cloud resource provisioning , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[11]  Athanasios V. Vasilakos,et al.  A Framework for Truthful Online Auctions in Cloud Computing with Heterogeneous User Demands , 2016, IEEE Transactions on Computers.

[12]  Zongpeng Li,et al.  An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing , 2016, IEEE/ACM Transactions on Networking.

[13]  Hai Jin,et al.  Flexible Instance: Meeting Deadlines of Delay Tolerant Jobs in the Cloud with Dynamic Pricing , 2016, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS).

[14]  Mung Chiang,et al.  RUSH: A RobUst ScHeduler to Manage Uncertain Completion-Times in Shared Clouds , 2016, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS).

[15]  Daniel Grosu,et al.  Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds , 2015, IEEE Transactions on Parallel and Distributed Systems.

[16]  Brendan Lucier,et al.  Bayesian algorithmic mechanism design , 2010, BQGT.

[17]  E. H. Clarke Multipart pricing of public goods , 1971 .

[18]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[19]  Liang Zheng,et al.  How to Bid the Cloud , 2015, Comput. Commun. Rev..

[20]  Kui Ren,et al.  When cloud meets eBay: Towards effective pricing for cloud computing , 2012, 2012 Proceedings IEEE INFOCOM.