earticle

논문검색

A Priority-driven ACO Algorithm for DAG Task Scheduling in Cloud Environment

초록

영어

Task scheduling in cloud environment is a key technical problem on how to allocate available cloud resources to cloud users. Usually, a task in cloud environment can be cut into a serials of subtasks, which have precedence and dependency relationships among themselves. We describe the problem by means of a DAG (Directed Acyclic Graph) model. Then, we propose a priority algorithm for DAG task scheduling, and a priority-driven ACO (Ant Colony Optimization) algorithm for DAG task scheduling on the basis of the DAG model. Finally, we compare these two algorithms with the greedy algorithm through simulation in the CloudSim platform. The simulation results show that the priority-driven ACO algorithm is effective to solve DAG task scheduling problem in cloud environment.

목차

Abstract
 1. Introduction
 2. The DAG Task Scheduling Model in Cloud Environment
 3. The Priority Algorithm for DAG Task Scheduling
 4. The Priority-driven ACO Algorithm for DAG Task Scheduling
 5. Simulation Results and Analysis
 6. Conclusions
 Acknowledgements
 References

저자정보

  • Haitao Xie School of Computer Science, Hubei University of Technology, Wuhan, China
  • Hongwei Chen School of Computer Science, Hubei University of Technology, Wuhan, China
  • Chunzhi Wang School of Computer Science, Hubei University of Technology, Wuhan, China

참고문헌

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

    함께 이용한 논문

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

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