CFP last date
20 January 2025
Reseach Article

Enhanced Heuristic Model for Effective Resource Utilization in Cloud

Published on November 2014 by S. Devipriya, B. Magesh Kumar, C. Ramesh
International Conference on Innovations in Information, Embedded and Communication Systems
Foundation of Computer Science USA
ICIIECS - Number 1
November 2014
Authors: S. Devipriya, B. Magesh Kumar, C. Ramesh
8648220b-3972-4dcc-b16f-330580a4ad9b

S. Devipriya, B. Magesh Kumar, C. Ramesh . Enhanced Heuristic Model for Effective Resource Utilization in Cloud. International Conference on Innovations in Information, Embedded and Communication Systems. ICIIECS, 1 (November 2014), 6-9.

@article{
author = { S. Devipriya, B. Magesh Kumar, C. Ramesh },
title = { Enhanced Heuristic Model for Effective Resource Utilization in Cloud },
journal = { International Conference on Innovations in Information, Embedded and Communication Systems },
issue_date = { November 2014 },
volume = { ICIIECS },
number = { 1 },
month = { November },
year = { 2014 },
issn = 0975-8887,
pages = { 6-9 },
numpages = 4,
url = { /proceedings/iciiecs/number1/18646-1407/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Innovations in Information, Embedded and Communication Systems
%A S. Devipriya
%A B. Magesh Kumar
%A C. Ramesh
%T Enhanced Heuristic Model for Effective Resource Utilization in Cloud
%J International Conference on Innovations in Information, Embedded and Communication Systems
%@ 0975-8887
%V ICIIECS
%N 1
%P 6-9
%D 2014
%I International Journal of Computer Applications
Abstract

A cloud is a type of distributed system, it consist of, collection of interconnected and virtualized computers. It offers pool of resources like data, software and infrastructure etc, to the user. So the efficient utilization of cloud resources has become a major challenge in cloud computing. Scheduling in cloud is responsible for selection of best suitable resources for executing a task, by considering some static and dynamic parameters like makespan, cost, resource utilization; speed etc. The Min-Min algorithm first executes smaller tasks [1]. So the Min-Min algorithm does not provide better performance when the number of smaller tasks is high, in this case the Max-Min algorithm outperforms Min-Min algorithm in terms of parameters like makespan and load balancing. So in order to overcome the limitations of Min-Min algorithm the improved version of Min-Min algorithm has been proposed. It randomly selects the task for execution based on the values of average completion time and standard deviation of existing tasks. Even though the improved Min-Min algorithm avoids the limitations of Min-Min algorithm; still it takes more time to execute large number of tasks. So the future work is to enhance the performance of improved Min-Min algorithm to execute large number of tasks within in a small time and also to use this algorithm in any one of the network technique to schedule packets in a cloud environment in an effective manner.

References
  1. He, X. , Sun, X. H. & Laszewski, G. V . 2003. QoS guided Min-Min heuristic for grid task scheduling. Journal of Computer Science & Technology, vol. 18, pp. 442-451.
  2. Etminani, K. , & Naghibzadeh, M. 2007. A Min-Min Max-Min selective algorithm for grid task scheduling. Proceeding of the Third IEEE/IFIP International Conference on Internet, Uzbekista, pp. 1-7.
  3. Khoo, B. T. , Veeravalli, B. , Hung, T. & See, S. W. 2007. A multi-dimensional scheduling scheme in a grid computing environment. Journal of Parallel and Distributed Computing, vol. 67, pp. 659-673.
  4. Mohammad, K. & Analoui, M. 2007. Grid_JQA: A QoS guided scheduling algorithm for grid computing. Proceeding of the Sixth International Symposium on Parallel and Distributed Computing (ISPDC'07), IEEE, pp. 34
  5. Munir, E. , Li, J. & Shi, S. 2007. QoS sufferage heuristic for independent task scheduling in grid. Information Technology Journal, vol. 6, no. 8, pp. 1166-1170.
  6. Yagoubi, B. & Slimani, Y. 2007. Task load balancing strategy for grid computing. Journal of Computer Science, vol. 3, no. 3, pp. 186-194.
  7. Afzal, A. , McGough, A. & Darlington, J. 2008. Capacity planning and scheduling in grid computing environment. Journal of Future Generation Computer Systems, vol. 24, pp. 404-414.
  8. Elmroth, E & Tordsson, J 2008. Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions. Journal of Future Generation Computer Systems, vol. 24, pp. 585-593.
  9. Parsa, S. & Entezari-Maleki, R. 2009. RASA: A new task scheduling algorithm in grid environment. In World Applied Science Journal 7, pp. 152-160.
  10. FatosXhafa, Ajith Abraham 2010. Computational models and heuristics methods for grid scheduling problems. Future Generation Computer systems, vol. 26, pp. 608-621.
  11. Kokilavani, T. and Dr. George Amalarethinam, D. , I. , 2011. Load Balanced Min-Min Algorithm for Static Meta-Task Scheduling in Grid Computing. International Journal of Computer Applications, vol. 20, No. 2, pp. 43-49.
  12. Sahu R. , Chaturvedi A. , K. , 2011Many-Objective Comparison of Twelve Grid Scheduling Heuristics. International Journal of Computer Applications ", vol13, pp. 9-17.
  13. Madhubala, R. , 2012. An Illustrative study on Cloud Computing. International Journal of Soft Computing and Engineering", vol. 1, issue 6, pp. 286-290.
  14. Anousha, S. & Ahmadi, M. 2013. A batch mode Min-Min scheduling algorithm in grid computing. Springer, pp. 103-113.
  15. Pional, S. 2013. A survey of scheduling algorithms in cloud computing environment. International Journal of Research in Engineering and Technology, vol. 2, pp. 131-135.
Index Terms

Computer Science
Information Sciences

Keywords

Cloud Computing Max-min Algorithm Min-min Algorithm Makespan