Load balanced reliable task scheduling algorithm for heterogeneous systems

2011 ◽  
Vol 18 (1) ◽  
pp. 33-45
Author(s):  
P. Chitra ◽  
R. Rajaram ◽  
P. Venkatesh
Keyword(s):  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Heterogeneous Systems ◽  
Task Scheduling Algorithm ◽  
Load Balanced

An effective duplication-based task-scheduling algorithm for heterogeneous systems

SIMULATION ◽  
2011 ◽  
Vol 87 (12) ◽  
pp. 1067-1080 ◽  
Author(s):  
Mahsa Hosseinzadeh ◽  
Hadi Shahriar Shahhoseini
Keyword(s):  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Heterogeneous Systems ◽  
Task Scheduling Algorithm

scholarly journals Alts: An Adaptive Load Balanced Task Scheduling Approach for Cloud Computing

Processes ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1514
Author(s):  
Aroosa Mubeen ◽  
Muhammad Ibrahim ◽  
Nargis Bibi ◽  
Mohammad Baz ◽  
Habib Hamam ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Resource Utilization ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Problem Size ◽  
Cloud Data ◽  
Sla Violation ◽  
Task Scheduling Algorithm ◽  
User Tasks ◽  
Load Balanced

According to the research, many task scheduling approaches have been proposed like GA, ACO, etc., which have improved the performance of the cloud data centers concerning various scheduling parameters. The task scheduling problem is NP-hard, as the key reason is the number of solutions/combinations grows exponentially with the problem size, e.g., the number of tasks and the number of computing resources. Thus, it is always challenging to have complete optimal scheduling of the user tasks. In this research, we proposed an adaptive load-balanced task scheduling (ALTS) approach for cloud computing. The proposed task scheduling algorithm maps all incoming tasks to the available VMs in a load-balanced way to reduce the makespan, maximize resource utilization, and adaptively minimize the SLA violation. The performance of the proposed task scheduling algorithm is evaluated and compared with the state-of-the-art task scheduling ACO, GA, and GAACO approaches concerning average resource utilization (ARUR), Makespan, and SLA violation. The proposed approach has revealed significant improvements concerning the makespan, SLA violation, and resource utilization against the compared approaches.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document