scholarly journals Efficient Task Scheduling using Load Balancing in Cloud Computing

2018 ◽  
Vol 10 (03) ◽  
pp. 3888-3892
Author(s):  
Rupinder Kaur ◽  
Dr.Kanwalvir Singh Dhindsa
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling

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

scholarly journals Multi-objective Prediction based Task Scheduling Method in Cloud Computing

2019 ◽  
Vol 8 (4) ◽  
pp. 9388-9394 ◽  
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling ◽  
Job Scheduling ◽  
Sigmoid Function ◽  
Service Model ◽  
Multi Objective ◽  
Computing Paradigm ◽  
Optimal Node ◽  
Scheduling Method

Cloud Computing is Internet based computing where one can store and access their personal resources from any computer through Internet. Cloud Computing is a simple pay-per-utilize consumer-provider service model. Cloud is nothing but large pool of easily accessible and usable virtual resources. Task (Job) scheduling is always a noteworthy issue in any computing paradigm. Due to the availability of finite resources and time variant nature of incoming tasks it is very challenging to schedule a new task accurately and assign requested resources to cloud user. Traditional task scheduling techniques are improper for cloud computing as cloud computing is based on virtualization technology with disseminated nature. Cloud computing brings in new challenges for task scheduling due to heterogeneity in hardware capabilities, on-demand service model, pay-per-utilize model and guarantee to meet Quality of Service (QoS). This has motivated us to generate multi-objective methods for task scheduling. In this research paper we have presented multi-objective prediction based task scheduling method in cloud computing to improve load balancing in order to satisfy cloud consumers dynamically changing needs and also to benefit cloud providers for effective resource management. Basically our method gives low probability value for not capable and overloaded nodes. To achieve the same we have used sigmoid function and Euclidean distance. Our major goal is to predict optimal node for task scheduling which satisfies objectives like resource utilization and load balancing with accuracy.

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 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

Load and Cost Aware Min-Min Workflow Scheduling Algorithm for Heterogeneous Resources in Fog, Cloud and Edge Scenarios

2022 ◽  
Vol 12 (1) ◽  
pp. 0-0
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Fog Computing ◽  
Workflow Scheduling ◽  
Heterogeneous Environment ◽  
Cloud Servers ◽  
Heterogeneous Resources

Fog computing and Edge computing are few of the latest technologies which are offered as solution to challenges faced in Cloud Computing. Instead of offloading of all the tasks to centralized cloud servers, some of the tasks can be scheduled at intermediate Fog servers or Edge devices. Though this solves most of the problems faced in cloud but also encounter other traditional problems due to resource-related constraints like load balancing, scheduling, etc. In order to address task scheduling and load balancing in Cloud-fog-edge collaboration among servers, we have proposed an improved version of min-min algorithm for workflow scheduling which considers cost, makespan, energy and load balancing in heterogeneous environment. This algorithm is implemented and tested in different offloading scenarios- Cloud only, Fog only, Cloud-fog and Cloud-Fog-Edge collaboration. This approach performed better and the result gives minimum makespan, less energy consumption along with load balancing and marginally less cost when compared to min-min and ELBMM algorithms

Sign in / Sign up

Export Citation Format

Share Document