A Truthful Mechanism for Value-Based Scheduling in Cloud Computing

  • Navendu Jain
  • Ishai Menache
  • Joseph (Seffi) Naor
  • Jonathan Yaniv
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6982)


We introduce a novel pricing and resource allocation approach for batch jobs on cloud systems. In our economic model, users submit jobs with a value function that specifies willingness to pay as a function of job due dates. The cloud provider in response allocates a subset of these jobs, taking into advantage the flexibility of allocating resources to jobs in the cloud environment. Focusing on social-welfare as the system objective (especially relevant for private or in-house clouds), we construct a resource allocation algorithm which provides a small approximation factor that approaches 2 as the number of servers increases. An appealing property of our scheme is that jobs are allocated non-preemptively, i.e., jobs run in one shot without interruption. This property has practical significance, as it avoids significant network and storage resources for checkpointing. Based on this algorithm, we then design an efficient truthful-in-expectation mechanism, which significantly improves the running complexity of black-box reduction mechanisms that can be applied to the problem, thereby facilitating its implementation in real systems.


Nism Alloca 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Archer, A., Tardos, É.: Truthful mechanisms for one-parameter agents. In: FOCS, pp. 482–491 (2001)Google Scholar
  2. 2.
    Babaioff, M., Kleinberg, R., Slivkins, A.: Truthful mechanisms with implicit payment computation. In: EC, pp. 43–52 (2010)Google Scholar
  3. 3.
    Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. JACM 48, 1069–1090 (2001)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal of Computing 31(2), 331–352 (2001)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Heidelberg (2004)CrossRefMATHGoogle Scholar
  6. 6.
    Dughmi, S., Roughgarden, T.: Black-box randomized reductions in algorithmic mechanism design. In: FOCS, pp. 775–784 (2010)Google Scholar
  7. 7.
    Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: FOCS, pp. 595–604 (2005)Google Scholar
  8. 8.
    Lavi, R., Swamy, C.: Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. In: EC (2007)Google Scholar
  9. 9.
    Lawler, E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Oper. Research 26, 125–133 (1991)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC (1999)Google Scholar
  11. 11.
    Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.V.: Algorithmic game theory. Cambridge University Press, Cambridge (2007)CrossRefMATHGoogle Scholar
  12. 12.
    Phillips, C.A., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. In: SODA, pp. 879–888 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Navendu Jain
    • 1
  • Ishai Menache
    • 1
  • Joseph (Seffi) Naor
    • 2
  • Jonathan Yaniv
    • 2
  1. 1.Extreme Computing GroupMicrosoft ResearchRedmond
  2. 2.Computer Science DepartmentTechnionIsrael

Personalised recommendations