Welcome to the InfoSci Platform
Reference Hub2
Meta-Heuristics Based Load Balancing Optimization in Cloud Environment on Underflow and Overflow Conditions

Meta-Heuristics Based Load Balancing Optimization in Cloud Environment on Underflow and Overflow Conditions

Amanpreet Kaur, Bikrampal Kaur, Dheerendra Singh
Copyright: © 2018 |Volume: 11 |Issue: 4 |Pages: 18
ISSN: 1938-7857|EISSN: 1938-7865|EISBN13: 9781522543237|DOI: 10.4018/JITR.2018100110
Cite Article Cite Article

MLA

Kaur, Amanpreet, et al. "Meta-Heuristics Based Load Balancing Optimization in Cloud Environment on Underflow and Overflow Conditions." JITR vol.11, no.4 2018: pp.155-172. http://doi.org/10.4018/JITR.2018100110

APA

Kaur, A., Kaur, B., & Singh, D. (2018). Meta-Heuristics Based Load Balancing Optimization in Cloud Environment on Underflow and Overflow Conditions. Journal of Information Technology Research (JITR), 11(4), 155-172. http://doi.org/10.4018/JITR.2018100110

Chicago

Kaur, Amanpreet, Bikrampal Kaur, and Dheerendra Singh. "Meta-Heuristics Based Load Balancing Optimization in Cloud Environment on Underflow and Overflow Conditions," Journal of Information Technology Research (JITR) 11, no.4: 155-172. http://doi.org/10.4018/JITR.2018100110

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In cloud environment, the main challenge is load balancing as it requires distributing the load among many various virtual machines (VM) while avoiding underflow and overflow conditions. In this article, the question that which load-balancing (overflow or underflow) management will better improves the performance and quality of service has been answered with a number of experiments. For experiment purpose, scientific workflow DAG files has been used with one host configuration. Ant Colony Optimization (ACO) and BAT algorithm are used for checking underflow and overflow conditions respectively for VMs. In proposed work, initially the workflow is parsed by Predict Earliest Finish Time (PEFT) heuristic to generate initial seed for meta-heuristic algorithms which will optimize the VM in terms of makespan and cost of execution. Different workflows have been used with varying number of VMs from 2 to 20. The results shows that makespan analysis is approximately overlapped for different workflow tasks and shows no significant difference however, the cost analysis show a significant change for overflow and underflow identification with cost for overflow condition is reduced significantly.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.