scholarly journals Desktop Grid Environment for Evolution Strategies using Grid Task Scheduling Algorithm RR

Author(s):  
Yoshiyuki MATSUMURA ◽  
Noriyuki FUJIMOTO ◽  
Yoshikazu MURAYAMA ◽  
Masaki MATSUDA ◽  
Masashi OISO
2013 ◽  
Vol 8 (10) ◽  
Author(s):  
Lijun Cao ◽  
Xiyin Liu ◽  
Torkel Hans-Georg Hans-Georg ◽  
Zhongping Zhang

2013 ◽  
Vol 443 ◽  
pp. 599-602
Author(s):  
Lei Chen

The Grid task scheduling algorithm is proposed that takes the service quality of resource scheduling, time and cost together into consideration, so that it can better meet user tasks Quality of Service (QoS) requirements and make the complex grid environment open. On the basis of the price model drove by supply and demand in economy, we design the Grid task scheduling algorithm in the market economy model. The experiment results indicate the effectiveness of proposed algorithm in terms of usersQoS guarantee. It reduce data access latency and decrease bandwidth consumption.


Author(s):  
Yoshiyuki Matsumura ◽  
Masashi Oiso ◽  
Masaki Matsuda ◽  
Noriyuki Fujimoto ◽  
Kenichi Hagihara ◽  
...  

Author(s):  
Yoshiyuki Matsumura ◽  
Kazuhiro Ohkura ◽  
Yoshiki Matsuura ◽  
Masashi Oiso ◽  
Noriyuki Fujimoto ◽  
...  

Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

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