Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud

Proceedings - IEEE INFOCOM

Volumn 2016-July, Issue , 2016, Pages

  Zheng, Zizhan ^a   Shroff, Ness B ^b  

^a University of California   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RESOURCE ALLOCATION; SCHEDULING;

CLOUD COMPUTING PLATFORMS; COMPETITIVE RATIO; INTERACTIVE SERVICES; ONLINE SCHEDULING; PARTIAL EXECUTIONS; REAL ENVIRONMENTS; SCHEDULING DECISIONS; UTILITY FUNCTIONS;

BIG DATA;

EID: 84983339496     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2016.7524430     Document Type: Conference Paper

References (33)

1. G. Ananthanarayanan, M. C.-C. Hung, X. Ren, I. Stoica, A. Wierman, and M. Yu. Grass: Trimming stragglers in approximation analytics. In Proc. of NSDI, 2014
2. D. P. Bertsekas. Nonlinear Programming, 2nd edition. Athena Scientific, 1999
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 2005
4. K. M. Bretthauer and B. Shetty. The nonlinear knapsack problem algorithms and applications. European Journal of Operational Research, 138:459-472, 2002
5. P. Briest, P. Krysta, and B. Vöcking. Approximation techniques for utilitarian mechanism design. SIAM Journal on Computing, 40(6):1587-1622, 2011
6. J. Brutlag. Speed matters for Google web search. http://services.google. com/fh/files/blogs/google delayexp.pdf, 2009
7. N. Buchbinder and J. Naor. The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science, 3(2-3):93-263, 2007
8. E.-C. Chang and C. Yap. Competitive online scheduling with level of service. Journal on Scheduling, 6:251-267, 2003
9. C. Chekuri and S. Khanna. On multi-dimensional packing problems. SIAM Journal on Computing, 33(4):837-851, 2004
10. F. Y. Chin, M. Chrobak, S. P. Fung, W. Jawor, J. Sgall, and T. Tichý. Online competitive algorithms for maximizing weighted throughput of unit jobs. Journal on Scheduling, 4:255-276, 2006
11. F. Y. L. Chin and S. P. Y. Fung. Online scheduling with partial job values: Does timesharing or randomization help? Algorithmica, 37:149-164, 2003
12. M. Chrobak, L. Epstein, J. Noga, J. Sgall, R. van Stee, T. Tichý, and N. Vakhania. Preemptive scheduling in overloaded systems. In Proc. of ICALP, 2002
13. M. Chrobak, L. Epstein, J. Noga, J. Sgall, R. van Stee, T. Tichý, and N. Vakhania. Preemptive scheduling in overloaded systems. Journal of Computer and System Sciences, 67:183-197, 2003
14. N. R. Devanur and Z. Huang. Primal dual gives almost optimal energy efficient online algorithms. In Proc. of SODA, 2014
15. A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker, and S. Shenker. Dominant resource fairness: Fair allocation of multiple resource types. In Proc. of NSDI, 2011
16. A. Gupta, R. Krishnaswamy, and K. Pruhs. Online primal-dual for nonlinear optimization with applications to speed scaling. In 10th Workshop on Approximation and Online Algorithms (WAOA), 2012
17. B. Hajek. On the competitiveness of on-line scheduling of unitlength packets with hard deadlines in slotted time. In Conference on Information Sciences and Systems, 2001
18. Y. He, S. Elnikety, and C. Y. James Larus. Zeta: Scheduling interactive services with partial execution. In Proc. of SoCC, 2012
19. N. Jain, I. Menache, J. S. Naor, and J. Yaniv. Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. ACM Transactions on Parallel Computing, 2(1), 2015
20. C. Joe-Wong, S. Sen, T. Lan, and M. Chiang. Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework. IEEE/ACM Transactions on Networking, 21(6):1785-1798, 2013
21. I. Kash, A. D. Procaccia, and N. Shah. No agent left behind: Dynamic fair division of multiple resources. Journal of Artificial Intelligence Research, 51:579-603, 2014
22. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in qos switches. In Proc. of STOC, 2001
23. G. Koren and D. Shasha. Dover: an optimal on-line scheduling algorithm for overloaded real-time systems. In Real-Time Systems Symposium, 1992
24. G. Linden. Marissa Mayer at Web 2.0. http://glinden.blogspot.com/ 2006/11/marissa-mayer-at-web-20.html, 2006
25. B. Lucier, I. Menache, J. S. Naor, and J. Yaniv. Efficient online scheduling for deadline-sensitive jobs. In Proc. of SPAA, 2013
26. D. C. Parkes, A. D. Procaccia, and N. Shah. Beyond dominant resource fairness: Extensions, limitations, and indivisibilities. ACM Transactions on Economics and Computation, 3(1):1785-1798, 2015
27. E. Schurman and J. Brutlag. The user and business impact of server delays, additional bytes, and http chunking in web search. In OReilly Velocity Web Performance and Operations Conference, 2009
28. W. Shi, L. Zhang, C. Wu, Z. Li, and F. C. Lau. An online auction framework for dynamic resource provisioning in cloud computing. In Proc. of Sigmetrics, 2014
29. S. Souders. Velocity and the bottom line. http://radar.oreilly.com/2009/ 07/velocity-making-your-site-fast.html, 2009
30. V. Srivastava and F. Bullo. Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization. European Journal on Operational Research, 236(2):488-498, 2014
31. L. Zhang, Z. Li, and C. Wu. Dynamic resource provisioning in cloud computing: A randomized auction approach. In Proc. of INFOCOM, 2014
32. Y. Zheng, B. Ji, N. B. Shroff, and P. Sinha. Forget the deadline: Scheduling interactive applications in data centers. In Proc. of IEEE Cloud, 2015
33. Z. Zheng and N. B. Shroff. Online welfare maximization for electric vehicle charging with electricity cost. In Proc. of ACM e-Energy, 2014