Earticle

초록

영어

Focusing on the problem that users would remove or delete the task at any time in cloud computing environment, a new scheduling algorithm for adapting to dynamic changes of user task is proposed. At first, the algorithm uses directed acyclic graph (DAG) to describe the association relation of cloud computing tasks. When a task needs to be removed, the algorithm utilizes a cost function to determine whether to cancel this task, and then updates the DAG according to its dependence on removed task. Finally, it uses a heuristic algorithm to perform scheduling. Experimental results show that this algorithm can better avoid scheduling execution of revoked tasks and improve the executive efficiency of cloud computing resource. Its performance is better than Min-Min and Max-Min in executive time span.

목차

Abstract
 1. Introduction
 2. System Assumptions and Model Definition
  2.1. System Assumptions
  2.2. System Model Definition
 3. Algorithm’s Description
 4. Instance Analysis
 5. Experimental Results and Analysis
 6. Conclusion
 Acknowledgements
 References

키워드

저자

• Taoshen Li [ School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China ]
• Xixiang Zhang [ College of Information Science and Technology, Hunan University, Changsha 4100075，China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605