earticle

논문검색

Research on Task Scheduling Convergence Non-Dominated Sorting Method in Cloud Computing

초록

영어

Cloud computing task scheduling is a multi-objective decision on how to perform a variety of tasks simultaneously reasonable sort is essential. Therefore, this article constructs a population of convergence non-dominated sorting method. This method is based on non-dominated sorting method; the use of distributed estimation method is improved by four steps to complete the task order scheduling. The experimental results show that this method has good convergence and distribution.

목차

Abstract
 1. Introduction
 2. Populations of Convergence Non-dominated Sorting Method
  2.1 Non-dominated Sorting Method
  2.2 Distribution Estimation Method
  2.3. Distribution Estimation Method
 3. Experiment and Analysis
 4. Conclusion
 Acknowledgements
 References

저자정보

  • Liang. Huang School of Mathematics&Computer Science, Shangrao Normal University, Shangrao, Jiangxi, China
  • Jun. Zheng School of Mathematics&Computer Science, Shangrao Normal University, Shangrao, Jiangxi, China
  • Guolv.Tan School of Mathematics&Computer Science, Shangrao Normal University, Shangrao, Jiangxi, China

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.