A Two-Step Data Placement and Task Scheduling Strategy for Optimizing Scientific Workflow Performance on Cloud Computing Platform

2011 ◽  
Vol 34 (11) ◽  
pp. 2121-2130 ◽  
Author(s):  
Shao-Wei LIU ◽  
Ling-Mei KONG ◽  
Kai-Jun REN ◽  
Jun-Qiang SONG ◽  
Ke-Feng DENG ◽  
...  
Author(s):  
Guolong Yu ◽  
Yong Zhao ◽  
Zhongwei Cui ◽  
Zuo Yu

The computing method of the average optimal position is one of the most important factors that affect the optimization performance of the QPSO algorithm. Therefore, a particle position weight computing method based on particle fitness value grading is proposed, which is called HWQPSO (hierarchical weight QPSO). In this method, the higher the fitness value of a particle, the higher the level of the particle, and the greater the weight. Particles at different levels have different weights, while particles at the same level have the same weight. Through this method, the excellent particles have higher average optimal position weight, and at the same time, the absolute weight of a few particles is avoided, so that the algorithm can quickly and stably converge to the optimal solution, and improve the optimization ability and efficiency of the algorithm. In order to verify the effective ness of the method, five standard test functions are selected to test the performance of HWQPSO, QPSO, DWC-QPSO and LTQPSO algorithm, and the algorithms are applied to the task scheduling of the cloud computing platform. Through the test experiment and application comparison, the results show that the HWQPSO algorithm can converge to the optimal solution of the test function faster than the other three algorithms. It can also find the task scheduling scheme with the shortest time consumption and the most balanced computing resource load in the cloud platform. In the experiment, compared with QPSO, DWC-QPSO and LTQPSO algorithm, HWQPSO execution time of the maximum task scheduling was reduced by 35%, 23% and 21% respectively.


2012 ◽  
Vol 241-244 ◽  
pp. 2929-2933
Author(s):  
Hai Wen Han ◽  
Zhi Fei Zhu

The scheduling mechanism for cloud computing platform is described at first in this paper. Secondly the analysis of the B2C auto-negotiation process and the characteristics of its computation resource scheduling mechanism are given. Finally some computation resource scheduling strategies for B2C auto-negotiation in cloud computing platform are discussed.


2012 ◽  
Vol 35 (6) ◽  
pp. 1262 ◽  
Author(s):  
Ke-Jiang YE ◽  
Zhao-Hui WU ◽  
Xiao-Hong JIANG ◽  
Qin-Ming HE

Sign in / Sign up

Export Citation Format

Share Document