Atomic operations for task scheduling for systems based on communication on-the-fly between SMP clusters

2004 ◽  
Author(s):  
L. Masko
Keyword(s):  
Task Scheduling ◽  
Smp Clusters

Moldable task scheduling in dynamic SMP clusters with communication on the fly

2004 ◽  
Author(s):  
L. Masko ◽  
G. Mounic ◽  
D. Trystram ◽  
M. Tudruj
Keyword(s):  
Task Scheduling ◽  
Smp Clusters ◽  
Moldable Task

Comparison of Program Task Scheduling Algorithms for Dynamic SMP Clusters with Communication on the Fly

2010 ◽  
pp. 31-41
Author(s):  
Łukasz Maśko ◽  
Marek Tudruj ◽  
Gregory Mounie ◽  
Denis Trystram
Keyword(s):  
Task Scheduling ◽  
Scheduling Algorithms ◽  
Smp Clusters

Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly

2005 ◽  
Author(s):  
L. Masko ◽  
G. Mounie ◽  
D. Trystram ◽  
M. Tudruj
Keyword(s):  
Task Scheduling ◽  
Smp Clusters ◽  
Moldable Task

How does manipulation of secondary task scheduling affect human performance?

2006 ◽  
Author(s):  
Patrice D. Tremoulet ◽  
Kathleen M. Stibler ◽  
Patrick Craven ◽  
Joyce Barton ◽  
Adam Gifford ◽  
...  
Keyword(s):  
Task Scheduling ◽  
Secondary Task ◽  
Human Performance

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.

A Survey on Task Scheduling For Parallel Workloads in the Cloud Computing System

2014 ◽  
Vol 03 (10) ◽  
pp. 16879-16885 ◽  
Author(s):  
ABHIJEET TIKAR ◽  
S.M.JAYB HAYE ◽  
G.R.PAT HAK
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Computing System ◽  
Cloud Computing System
Sign in / Sign up

Export Citation Format

Share Document