Optimization of Distributed System through Load Balancing and Task Scheduling

2017 ◽  
Vol 7 (2) ◽  
pp. 75-82
Author(s):  
Abhijit A. Rajguru ◽  
◽  
Sulabha S. Apte ◽  
Keyword(s):  
Load Balancing ◽  
Distributed System ◽  
Task Scheduling ◽  
And Task

Task Scheduling in cloud using ACO

2020 ◽  
Vol 13 ◽  
Author(s):  
Yuvaraj Natarajan ◽  
Srihari Kannan ◽  
Gaurav Dhiman
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Limited Resource ◽  
Cloud Environment ◽  
Clear Cut ◽  
Strategic Approach ◽  
User Demand ◽  
Scheduling Strategies ◽  
Cloud Users ◽  
And Task

Background: Cloud computing is a multi-tenant model for computation that offers various features for computing and storage based on user demand. With increasing cloud users, the usage increases that highlights the problem of load balancing with limited resource availability based on dynamic cloud environment. In such cases, task scheduling creates fundamental issue in cloud environment. Introduction: Certain problems such as, inefficiencies in load balancing latency, throughput ratio, proper utilization of the cloud resources, better energy consumption and response time have been observed. These drawbacks can be efficiently resolved through the incorporation of efficient load balancing and task scheduling strategies. Method: In this paper, we develop an efficient co-operative method to solve the most recent approaches against load balancing and task scheduling have been proposed using Ant Colony Optimization (ACO). These approaches enables in the clear cut identification of the problems associated with the load balancing and task scheduling strategies in the cloud environment. Results: The simulation is conducted to find the efficacy of the improved ACO system for load balancing in cloud than the other methods. The result shows that the proposed method obtains reduced execution time, reduced cost and delay. Conclusion: A unique strategic approach is developed in this paper, Load Balancing, which works with the ACO in relation to the cloud workload balancing task through the incorporation of the ACO technique. The strategy for determining the applicant nodes is based on which the load balancing approach would essentially depend. By incorporating two different approaches: the maximum minute rules and the forward-backward ant, this reliability task can be established. This method is intended to articulate the initialization of the pheromone and thus upgrade the relevant cloud-based physical properties.

scholarly journals An efficient Task Scheduling and Load Balancing in Cloud Computing using KD-Tree Algorithm

2019 ◽  
Vol 9 (2) ◽  
pp. 2426-2433
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling ◽  
Heuristic Algorithms ◽  
Research Work ◽  
Tree Algorithm ◽  
Cloud Resource Management ◽  
High Resource ◽  
Cloud Resource ◽  
And Task

Cloud Computing provides the sharing ability and access for available cloud host and various distributed environments, namely Load Balancing (LB), virtualization technologies and scheduling techniques. The satisfaction of both users and cloud providers are the major issues for effective LB and task scheduling algorithms in cloud resource management, where the requirements namely high resource utilization, low monetary costs and minimum makespan. Many researchers tried to develop various heuristic and meta-heuristic algorithms to attain the aforementioned user requirements. But, when the number of tasks grows exponentially, these algorithms failed to achieve LB, lower running time, and it faces the high time complexity. In this research work, a KD-Tree algorithm is developed to address the issues of heuristic algorithms and provide efficient LB by partitioning the environments into several tasks. According to the deadline of task execution, the remaining tasks are adjusted dynamically by the proposed KD-tree algorithm in the virtual environment. The experiments are conducted to evaluate the efficiency of KD-Tree algorithm with existing heuristic techniques by using makespan, energy consumption and task migrations. When the number of tasks is 20, the proposed KD-Tree algorithm achieved 71.33% makespan and 5% task migrations.

scholarly journals Hybrid Load Balancing Approach based on the Integration of QoS and Power Consumption in Cloud Computing

2021 ◽  
Vol 10 (2) ◽  
pp. 1079-1090
Keyword(s):  
Load Balancing ◽  
Power Consumption ◽  
Task Scheduling ◽  
Hybrid Algorithm ◽  
Virtual Machines ◽  
Average Response ◽  
Average Response Time ◽  
The Past ◽  
Load Balancing Algorithm ◽  
And Task

Over the past few years, there has been keen research interest in load balancing and task scheduling in the cloud as the extensive amount of data that is stored in the server leads to significantly increased load. This can be resolved by using a hybrid algorithm in which the honeybee behavior algorithm’s advantages are integrated with fuzzy logic to conduct task scheduling and as well as balancing in the cloud. The design of this hybrid algorithm aims to enhance prior approaches. It is developed as per ABC and merges the important QoS factors along with power consumption so that the power that virtual machines (VMs) consume on the host can be precisely assessed, thereby ensuring efficient load balancing algorithm. The present study aims to evaluate the VMs’ power consumption by taking into account crucial QoS factors for selecting which host and virtual machine will be best suited for receiving the task. CloudSim was used to simulate the ILBA_HB algorithm. In terms of makespan, average response time, and degree of imbalance, the performance of the ILBA HB algorithm is compared to that of the LBA HB and HBB-LB algorithms. According to the results, the proposed algorithm outperformed LBA_HB and HBB-LB.

Sign in / Sign up

Export Citation Format

Share Document