...
首页> 外文期刊>Journal of supercomputing >PSO-RDAL: particle swarm optimization-based resource- and deadline-aware dynamic load balancer for deadline constrained cloud tasks
【24h】

PSO-RDAL: particle swarm optimization-based resource- and deadline-aware dynamic load balancer for deadline constrained cloud tasks

机译:PSO-RDAL: particle swarm optimization-based resource- and deadline-aware dynamic load balancer for deadline constrained cloud tasks

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Cloud computing is an Internet-provisioned computing paradigm that provides scalable resources for the execution of the end user's tasks. The cloud users lease optimal resources that meet their demands with minimum cost and time. The cloud service providers need high utilization of cloud resources and minimized execution cost. To achieve high user satisfaction and improve utilization of cloud resources, the task scheduling techniques should be resource and deadline aware and distribute the workload in a balanced manner. A number of heuristic and meta-heuristic-based task scheduling approaches have been proposed; however, the majority of these approaches are not resource and deadline aware. Moreover, these schedulers either optimize a single objective or multiple objectives with non-conflicting parameters. However, there is a need for schedulers that can provide a balanced solution for conflicting parameters like time and cost. In this paper, a modified and adaptive PSO-based resource- and deadline-aware dynamic load-balanced (PSO-RDAL) algorithm is proposed. The PSO-RDAL scheduling technique aims to provide an optimized solution for the workload of independent and compute-intensive tasks with reasonable time and cost. Moreover, the proposed approach also supports multi-objective-based optimization with conflicting parameters like time and cost. The experimental results reveal that the PSO-RDAL has gained up to 66, 162, 56, 89, 98, and 97 enhancement in terms of makespan, average resource utilization, task response time, meeting task deadline, penalty cost, and total execution cost, respectively, as compared to existing state-of-the-art tasks scheduling heuristics.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号