返回
Green cloud environment by using robust planning algorithm
DOI:10.1016/j.eij.2017.02.001.png)
摘要
En 中文
Cloud computing provided a framework for seamless access to resources through network. Access to resources is quantified through SLA between service providers and users. Service provider tries to best exploit their resources and reduce idle times of the resources. Growing energy concerns further makes the life of service providers miserable. User's requests are served by allocating users tasks to resources in Clouds and Grid environment through scheduling algorithms and planning algorithms. With only few Planning algorithms in existence rarely planning and scheduling algorithms are differentiated. This paper proposes a robust hybrid planning algorithm, Robust Heterogeneous-Earliest-Finish-Time (RHEFT)(1) for binding tasks to VMs. The allocation of tasks to VMs is based on a novel task matching algorithm called Interior Scheduling. The consistent performance of proposed RHEFT algorithm is compared with Heterogeneous-Earliest-Finish-Time (HEFT)(2) and Distributed HEFT (DHEFT)(3) for various parameters like utilization ratio, makespan, Speed-up and Energy Consumption. RHEFT's consistent performance against HEFT and DHEFT has established the robustness of the hybrid planning algorithm through rigorous simulations. (C) 2017 Production and hosting by Elsevier B.V. on behalf of Faculty of Computers and Information, Cairo University. This is an open access article under the CC BY-NC-ND license.
Keyword:
Planning algorithms
Scheduling algorithms
Ready wueue
Robust
Cloud computing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
770
被引数:
1.4K
机构
引用论文
Low-time complexity budget-deadline constrained workflow scheduling on heterogeneous resources异构资源上的低时间复杂度预算截止期限约束工作流调度
Performance-effective and low-complexity task scheduling for heterogeneous computing面向异构计算的高性能低复杂度任务调度

