中国邮电高校学报(英文) ›› 2016, Vol. 23 ›› Issue (6): 8-15.doi: 10.1016/S1005-8885(16)60064-X

• Artificial Intelligence • 上一篇    下一篇

Deadline based scheduling for data-intensive applications in clouds

付雄1,仓业亮1,朱力鹏2,2,胡斌2,3,邓松1   

  1. 1. 南京邮电大学
    2.
    3. 全球能源互联网研究院
  • 收稿日期:2016-08-12 修回日期:2016-12-16 出版日期:2016-12-31 发布日期:2016-12-30
  • 通讯作者: 仓业亮 E-mail:1036405361@qq.com
  • 基金资助:
    中国国家自然科学基金

Deadline based scheduling for data-intensive applications in clouds

  • Received:2016-08-12 Revised:2016-12-16 Online:2016-12-31 Published:2016-12-30
  • Supported by:
    National Natural Science Foundation of China

摘要: Cloud computing emerges as a new computing pattern that can provide elastic services for any users around the world. It provides good chances to solve large scale scientific problems with fewer efforts. Application deployment remains an important issue in clouds. Appropriate scheduling mechanisms can shorten the total completion time of an application and therefore improve the quality of service (QoS) for cloud users. Unlike current scheduling algorithms which mostly focus on single task allocation, we propose a deadline based scheduling approach for data-intensive applications in clouds. It does not simply consider the total completion time of an application as the sum of all its subtasks’ completion time. Not only the computation capacity of virtual machine (VM) is considered, but also the communication delay and data access latencies are taken into account. Simulations show that our proposed approach has a decided advantage over the two other algorithms.

关键词: virtual machine placement, cloud computing, data intensive, deadline based

Abstract: Cloud computing emerges as a new computing pattern that can provide elastic services for any users around the world. It provides good chances to solve large scale scientific problems with fewer efforts. Application deployment remains an important issue in clouds. Appropriate scheduling mechanisms can shorten the total completion time of an application and therefore improve the quality of service (QoS) for cloud users. Unlike current scheduling algorithms which mostly focus on single task allocation, we propose a deadline based scheduling approach for data-intensive applications in clouds. It does not simply consider the total completion time of an application as the sum of all its subtasks’ completion time. Not only the computation capacity of virtual machine (VM) is considered, but also the communication delay and data access latencies are taken into account. Simulations show that our proposed approach has a decided advantage over the two other algorithms.

Key words: virtual machine placement, cloud computing, data intensive, deadline based