首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:Task Scheduling Algorithm based on Greedy Strategy in Cloud Computing
  • 本地全文:下载
  • 作者:Zhou Zhou ; Hu Zhigang
  • 期刊名称:The Open Cybernetics & Systemics Journal
  • 电子版ISSN:1874-110X
  • 出版年度:2014
  • 卷号:8
  • 期号:1
  • 页码:111-114
  • DOI:10.2174/1874110X01408010111
  • 出版社:Bentham Science Publishers Ltd
  • 摘要:

    In view of Min-Min algorithm prefers scheduling small tasks and Max-Min algorithm prefers scheduling big tasks led to the problem of load imbalance in cloud computing, a new algorithm named Min-Max is proposed. Min-Max makes good use of time of greedy strategy, small tasks and big tasks are put together for scheduling in order to solve the problem of load imbalance. Experimental results show that the Min-Max improves the utilization rate of the entire system and saves 9% of the overall execution time compared with Min-Min. As compared to Max-Min, Min-Max improves the utilization rate of the entire system and the total completion time and average response time are saved by 7% and 9%, respectively.

国家哲学社会科学文献中心版权所有