Budget estimation and control for bag-of-tasks scheduling in clouds

Parallel Processing Letters

Volumn 21, Issue 2, 2011, Pages 219-243

  Oprescu, Ana Maria ^a   Kielmann, Thilo ^a   Leahu, Haralambie ^b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

cloud computing; linear regression; runtime estimation; sampling

Indexed keywords

BUDGET CONSTRAINT; COMPLETION TIME; COMPUTE RESOURCES; ESTIMATE COST; MAKESPAN; MULTICLUSTER SYSTEMS; RUNTIMES; TIME INTERVAL;

CLOUD COMPUTING; CLUSTER COMPUTING; ESTIMATION; MAMMALS; SCHEDULING; SCHEDULING ALGORITHMS;

BUDGET CONTROL;

EID: 79959714456     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626411000175     Document Type: Article

References (23)

1. D. Thain, T. Tannenbaum, and M. Livny. Distributed computing in practice: The condor experience. Concurrency - Practice and Experience, 17(2-4):323-356, 2005. (Pubitemid 40285781)
2. Amazon Web Services. http://aws.amazon.com.
3. A.-M. Oprescu and T. Kielmann. Bag-of-Tasks Scheduling under Budget Constraints. In 2nd IEEE International Conference on Cloud Computing Technology and Science (CloudCom 2010), Indianapolis, USA, 2010. IEEE.
4. E. S. Keeping. Introduction to Statistical Inference. D. Van Nostrand, Princeton, New Jersey, 1962.
5. J. F. Kenney and E. S. Keeping. Mathematics of Statistics. D. Van Nostrand, Prince- ton, New Jersey, 1962.
6. W. N. Venables and B. D. Ripley. Modern Applied Statistics with S. Fourth Edition. Springer, 2002.
7. S. Martello and P. Toth. Knapsack problems: algorithms and computer implementa- tions. John Wiley & Sons, Inc., New York, NY, USA, 1990.
8. D. Pisinger. A minimal algorithm for the bounded knapsack problem. Technical re- port, University of Copenhagen, 1994.
9. H. E. Bal, J. Maassen, R. V. van Nieuwpoort, N. Drost, R. Kemp, N. Palmer, G. Wrzesinska, T. Kielmann, F. Seinstra, and C. Jacobs. Real-world distributed com- puting with Ibis. Computer, 43(8):54-62, 2010.
10. A. Iosup, O. Sonmez, S. Anoep, and D. Epema. The performance of bags-of-tasks in large-scale distributed systems. In HPDC '08: Proceedings of the 17th international symposium on High performance distributed computing, pages 97-108, New York, NY, USA, 2008. ACM.
11. Y. C. Lee and A. Y. Zomaya. Practical scheduling of bag-of-tasks applications on grids with dynamic resilience. IEEE Transactions on Computers, 56(6):815-825, 2007.
12. P. Sugavanam, H. Siegel, A. Maciejewski, J. Zhang, M. Shestak, M. Raskey, A. Pippin, R. Pichel, M. Oltikar, A. Mehta, P. Lee, Y. Krishnamurthy, A. Horiuchi, K. Guru, M. Aydin, M. Al-Otaibi, and S. Ali. Robust processor allocation for independent tasks when dollar cost for processors is a constraint. In IEEE International Conference on Cluster Computing, 2005.
13. P. Sugavanam, H. J. Siegel, A. A. Maciejewski, M. Oltikar, A. M. Mehta, R. Pichel, A. Horiuchi, V. Shestak, M. Al-Otaibi, Y. G. Krishnamurthy, S. A. Ali, J. Zhang, M. Aydin, P. Lee, K. Guru, M. Raskey, and A. J. Pippin. Robust static allocation of resources for independent tasks under makespan and dollar cost constraints. J. Parallel Distrib. Comput., 67(4):400-416, 2007. (Pubitemid 46441724)
14. C. Weng and X. Lu. Heuristic scheduling for bag-of-tasks applications in combination with qos in the computational grid. Future Generation Comp. Syst., 21(2):271-280, 2005.
15. H. González-Vélez. Self-adaptive skeletal task farm for computational grids. Parallel Comput., 32(7):479-490, 2006. (Pubitemid 44634781)
16. J. Smith, L. D. Briceno, A. A. Maciejewski, H. J. Siegel, T. Renner, V. Shestak, J. Ladd, A. M. Sutton, D. L. Janovy, S. Govindasamy, A. Alqudah, R. Dewri, and P. Prakash. Measuring the robustness of resource allocations in a stochastic dynamic environment. In IPDPS, 2007.
17. Ming Mao, Jie Li, and Marty Humphrey. Cloud Auto-scaling with Deadline and Bud- get Constraints In The 11th ACM/IEEE International Conference on Grid Comput- ing (Grid 2010), Brussels, Belgium, 2010.
18. Q. Zhu and G. Agrawal. An adaptive middleware for supporting time-critical event response. International Conference on Autonomic Computing, pages 99-108, 2008.
19. Q. Zhu and G. Agrawal. A resource allocation approach for supporting time-critical applications in grid environments. International Symposium on Parallel and Distributed Processing, pages 1-12, 2009.
20. W. Cirne, D. P. da Silva, L. Costa, E. Santos-Neto, F. V. Brasileiro, J. P. Sauvé, F. A. B. Silva, C. O. Barros, and C. Silveira. Running bag-of-tasks applications on computational grids: The mygrid approach. In ICPP, 2003.
21. O. H. Ibarra and C. E. Kim. Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. ACM, 24(2):280-289, 1977.
22. M.Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In Eighth Heterogeneous Computing Workshop, pages 30-44. IEEE Computer Society Press, 1999.
23. K. Liu, H. Jin, J. Chen, X. Liu, D. Yuan, and Y. Yang. A compromised-time-cost scheduling algorithm in swindew-c for instance-intensive cost-constrained workflows on a cloud computing platform. International Journal of High Performance Computing Applications, 24(4):445-456, 2010.