Analyzing Task Scheduling Algorithms and Load Balancing Approach to Enhance the Performance of Cloud Computing

2019 ◽  
Author(s):  
Vivek Gehlot ◽  
S.P. Singh ◽  
Akash Saxena
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithms

scholarly journals HAMM: A Hybrid Algorithm of Min-Min and Max-Min Task Scheduling Algorithms in Cloud Computing

2020 ◽  
Vol 9 (4) ◽  
pp. 209-218
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling ◽  
Hybrid Algorithm ◽  
Heuristic Algorithms ◽  
Scheduling Algorithms ◽  
Cloud Computing Environment ◽  
Concurrent Execution ◽  
Optimization Parameters ◽  
Better Than

Nowadays, with the huge development of information and computing technologies, the cloud computing is becoming the highly scalable and widely computing technology used in the world that bases on pay-per-use, remotely access, Internet-based and on-demand concepts in which providing customers with a shared of configurable resources. But, with the highly incoming user’s requests, the task scheduling and resource allocation are becoming major requirements for efficient and effective load balancing of a workload among cloud resources to enhance the overall cloud system performance. For these reasons, various types of task scheduling algorithms are introduced such as traditional, heuristic, and meta-heuristic. A heuristic task scheduling algorithms like MET, MCT, Min-Min, and Max-Min are playing an important role for solving the task scheduling problem. This paper proposes a new hybrid algorithm in cloud computing environment that based on two heuristic algorithms; Min-Min and Max-Min algorithms. To evaluate this algorithm, the Cloudsim simulator has been used with different optimization parameters; makespan, average of resource utilization, load balancing, average of waiting time and concurrent execution between small length tasks and long size tasks. The results show that the proposed algorithm is better than the two algorithms Min-Min and Max-Min for those parameters

scholarly journals Quality of Service based Task Scheduling Algorithms in Cloud Computing

2017 ◽  
Vol 7 (2) ◽  
pp. 1088 ◽  
Author(s):  
Sirisha Potluri ◽  
Katta Subba Rao
Keyword(s):  
Cloud Computing ◽  
Quality Of Service ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithms ◽  
Task Time ◽  
The Cost

<p>In cloud computing resources are considered as services hence utilization of the resources in an efficient way is done by using task scheduling and load balancing. Quality of service is an important factor to measure the trustiness of the cloud. Using quality of service in task scheduling will address the problems of security in cloud computing. This paper studied quality of service based task scheduling algorithms and the parameters used for scheduling. By comparing the results the efficiency of the algorithm is measured and limitations are given. We can improve the efficiency of the quality of service based task scheduling algorithms by considering these factors arriving time of the task, time taken by the task to execute on the resource and the cost in use for  the communication.</p>

scholarly journals Capacity Preserve Assignment Scheduling Algorithm in context of Determination System for Cloud Computing

2019 ◽  
Vol 8 (2S8) ◽  
pp. 647-650
Keyword(s):  
Cloud Computing ◽  
Information Systems ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Processing Condition ◽  
Feedback Mechanism ◽  
Determination System

Booking figuring is reliably a fervently issue in appropriated processing condition. Remembering the true objective to take out system bottleneck and modify stack logically. A stack changing endeavor booking count in light of weighted self-assertive and input frameworks was proposed in this paperFrom the outset the picked cloud masterminding host picked assets by necessities and made static estimation, and some time later coordinated them; other than the tally picked assets from which composed by weight self-confidently; by then it got standing out powerful data from effect burden to channel and sort the left. Finally it accomplished oneself adaptively to structure stack through information systems. The examination demonstrates that the calculation has stayed away from the framework bottleneck adequately and has accomplished adjusted burden and furthermore self-flexibility to it.keywords: Task Scheduling; Feedback Mechanism; Cloud Computing; Load Balancing

Efficient on Demand Dynamic Availability-Distribution-Span Scheduling and Load Balancing Scheme for Cloud Computing

2016 ◽  
Vol 13 (10) ◽  
pp. 7655-7660 ◽  
Author(s):  
V Jeyakrishnan ◽  
P Sengottuvelan
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Resource Utilization ◽  
Scheduling Algorithms ◽  
Time Factor ◽  
Cloud Environment ◽  
On Demand ◽  
Availability Factor ◽  
Scheduling Method

The problem of load balancing in cloud environment has been approached by different scheduling algorithms. Still the performance of cloud environment has not been met to the point and to overcome these issues, we propose a naval ADS (Availability-Distribution-Span) Scheduling method to perform load balancing as well as scheduling the resources of cloud environment. The method performs scheduling and load balancing in on demand nature and takes dynamic actions to fulfill the request of users. At the time of request, the method identifies set of resources required by the process and computes Availability Factor, Distributional Factor and Span Time factor for each of the resource available. Based on all these factors computed, the method schedules the requests to be processed in least span time. The proposed method produces efficient result on scheduling as well as load balancing to improve the performance of resource utilization in the cloud environment.

Sign in / Sign up

Export Citation Format

Share Document