i-manager Publications

A Survey of Various Task Scheduling Algorithms In Cloud Computing

V. Krishna Reddy*, SRIKANTH REDDY VELAMURI**

* M.Tech Student, IT Department, Lakireddy Bali Reddy College of Engineering, Mylavaram, India.

** Professor, IT Department, Lakireddy Bali Reddy College of Engineering, Mylavaram, India.

Periodicity:March - May'2013
DOI : https://doi.org/10.26634/jcom.1.1.2273

Abstract

Cloud computing is the emerging technology now a days. Many organizations are providing the services through the cloud which helps in avoiding the problems with data carrying. In the past,lots of research has been done in cloud computing. The main advantage of this is the data security. The data in cloud has no hindrances and can be accessed from anywhere at any time. This made the technology very useful. As the cloud has more clients that are accessing the cloud, it has to manage the tasks that are performed by the clients on the server machine. There are several algorithms that are used to schedule the tasks in cloud computing. This paper gives a brief idea about various task scheduling algorithms used in cloud computing.

Keywords

Task Scheduling, Cloud Computing

How to Cite this Article?

Reddy, V.S., and Reddy, V.K. (2013). A Survey of Various Task Scheduling Algorithms in Cloud Computing. i-manager’s Journal on Computer Science, 1(1), 1-7. https://doi.org/10.26634/jcom.1.1.2273

References

[1]. S. Venugopal, J. Broberg, and R. Buyya, (2009). Openpex: An open provisioning and execution system for virtual machines. Technical Report CLOUDS-TR-2009-8, CLOUDS Laboratory, The University of Melbourne, Australia.

[2]. E. Elmroth and J. Tordsson, (2005). “A grid resource broker supporting advance reservations and Benchmark-based resource selection”, In Lecture Notes in Computer Science, Springer-Verlag, pages 1061–1070.

[3]. R. Buyya, S. Pandey, and C. Vecchiol, (2009). “Cloudbus toolkit for market-oriented cloud computing”, In Proceedings of the 1st International Conference on Cloud Computing, Springer-Verlag, pages 24–44.

[4]. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, (1953). “Equations of state calculations by fast computing machines”, J. Chem. Phys., 21:1087-1091.

[5]. J. Kennedy, and R.C. Eberhart, (1995). “Particle swarm optimization, in Proc. IEEE Conf. on Neural Networks”, IV, Piscataway, NJs, pp. 1942–1948.

[6]. R.F. Freund, M. Gherrity, S. Ambrosius, M. Campbell, M. Halderman, D. Hensgen, E. Keith, T. Kidd. Kussow, J.D. Lima, F. Mirabile, L. Moore, B. Rust, and H.J. Siegel, (1998). “Scheduling resources in multiuser, Heterogeneous, computing environments with SmartNet”, in 7th IEEE Heterogeneous Computing Workshop (HCW '98), pp. 184–199.

[7]. R. Armstrong, D. Hensgen, and T. Kidd, (1998). “The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions”, in 7th IEEE Heterogeneous Computing Workshop (HCW '98), pp. 79–87.

[8]. Maheswaran, M., Ali, S., Siegel, H.J., et al, (1999). “Dynamic Mapping of a Class of Independent tasks onto Heterogeneous Computing Systems”, 8th IEEE Heterogeneous Computing Workshop (HCW '99), pp. 30-44, April.

[9]. M. Maheswaran, S. Ali, H.J. Siegel, D. Hensgen, and R. F. Freund, (1999). “Dynamic mapping of a class of independent tasks onto heterogeneous computing systems,” J. of Parallel and Distributed Computing, Vol. 59, No. 2, pp. 107-121, Nov.

[10]. D. Borthakur, (2007). “The Hadoop Distributed File System: Architecture and Design”, the Apache Software Foundation.

[11]. M. Zaharia, A. Konwinski, A. D. Joseph, R. H. Katz, and I. Stoica, (2008). “Improving mapreduce performance in heterogeneous environments”, In R. Draves and R. van Renesse, editors, Proceedings of Symposium on Operating Systems Design and Implementation, pages 29–42. USENIX Association.

[12]. M. Zaharia, D. Borthakur, J. Sen Sarma, K. Elmeleegy, S. Shenker, and I. Stoica, (2009). “Job scheduling for multi-user mapreduce clusters”, Technical Report UCB/EECS-2009-55, EECS Department, University of California, Berkeley, April.

[13]. M. Zaharia, D. Borthakur, J. S. Sarma, K. Elmeleegy, S. Shenker, and I. Stoica, (2010). “Delay scheduling:a simple technique for achieving locality and fairness in cluster scheduling”, In Proceedings of International Conference on EuroSys, pages 265–278.

[14]. C.L. Liu and J.W. Layland, (1973). “Scheduling algorithms for multiprogramming in a hard-real-time environment”, Journal of the Association for Computing Machinery, 20(1): 46–61.

[15]. P. Uthaisombut, (2008). “Generalization of edf and llf: Identifying all optimal online algorithms for Minimizing maximum lateness”, Algorithmica, 50:312–328.

[16]. V. Krishna Reddy, B. Thirumal Rao, Dr. L.S.S. Reddy, (2011). “Research Issues in Cloud Computing”, Global Journal of Computer Science and Technology, Volume 11, Issue 11, June.

[17]. V. Krishna Reddy, Dr. L.S.S. Reddy, (2011). “Security Architecture of Cloud Computing”, International Journal of Engineering Science and Technology (ISSN:0975-5462), Volume 3, Issue 9, September 2011.pp 7149-7155.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.