首页> 外文会议>World congress on computer science and information engineering;CSIE 2011 >An Improved Algorithm Based on Max-Min for Cloud Task Scheduling
【24h】

An Improved Algorithm Based on Max-Min for Cloud Task Scheduling

机译:一种基于最大最小的云任务调度改进算法

获取原文

摘要

Max-min algorithm is a classic grid computing task scheduling algorithm, but Max-min algorithm for task scheduling under the cloud have many problems. To solve this problems, this paper propose an improved algorithm MMST based on Max-min, which can not only solve the problem short task waiting time is too longer, but also can solve the problem when the number of the task is little, but using too many resources. Finally the algorithm MMST reduces the expenses of cloud services.
机译:Max-min算法是一种经典的网格计算任务调度算法,但是在云环境下用于任务调度的Max-min算法存在很多问题。为了解决这个问题,本文提出了一种基于Max-min的改进算法MMST,它不仅可以解决任务等待时间短,等待时间过长的问题,而且可以解决任务数少的问题。资源太多。最终,MMST算法减少了云服务的费用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号