earticle

논문검색

Minimum Makespan Task Scheduling Algorithm in Cloud Computing

원문정보

초록

영어

Cloud computing provides powerful and on-demand business environment. It is built on top of virtualized data centers. Virtualization provides the flexible infrastructure for cloud. But, managing the resources and scheduling the tasks in virtualized data center is a challenging task. This paper proposes a minimum makespan task scheduling framework named MMSF and minimum makespan task scheduling algorithm named as MMA. This algorithm is developed with two objectives. First, minimizing the total makespan and maximizing the virtual machine utilization. The task scheduling problem is formulated as multi-objective optimization problem. It is solved by using optimization techniques. Experiments shows that MMA outperforms the traditional task scheduling algorithms based on total makespan and virtual machine utilization.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Problem Statement
 4. Minimum Makespan Scheduling Framework
 5. MMA Algorithm
 6. Experiment on MMA
 7. Conclusion
 References

저자정보

  • N. Sasikaladevi School of Computing, SASTRA University, Tamilnadu, India

참고문헌

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

    함께 이용한 논문

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

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