Dynamic QoS-based task scheduling with packing and partial cloning in optical grid

2008 ◽  
Author(s):  
Hui Yuan ◽  
Lei Liu ◽  
Jian Wu ◽  
Xiaobin Hong ◽  
Jintong Lin
Keyword(s):  
Task Scheduling ◽  
Optical Grid

Task scheduling algorithm for optical grid architecture

2006 ◽  
Author(s):  
Wei Guo ◽  
Zhenyu Sun ◽  
Zhengyu Wang ◽  
Pengshan Zhang ◽  
Jing Ma ◽  
...  
Keyword(s):  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Grid Architecture ◽  
Task Scheduling Algorithm ◽  
Optical Grid

Task scheduling accuracy analysis in optical grid environments

2008 ◽  
Vol 17 (3) ◽  
pp. 209-217 ◽  
Author(s):  
Wei Guo ◽  
Zhengyu Wang ◽  
Zhenyu Sun ◽  
Weiqiang Sun ◽  
Yaohui Jin ◽  
...  
Keyword(s):  
Task Scheduling ◽  
Accuracy Analysis ◽  
Grid Environments ◽  
Optical Grid

On accurate task scheduling in Optical Grid

2007 ◽  
Author(s):  
Zhengyu Wang ◽  
Wei Guo ◽  
Zhenyu Sun ◽  
Yaohui Jin ◽  
Weiqiang Sun ◽  
...  
Keyword(s):  
Task Scheduling ◽  
Optical Grid

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.

Sign in / Sign up

Export Citation Format

Share Document