IaaS云中的任务延迟感知调度策略

T. M. A. Teresa, Niyas Ibrahim, K. R. R. Babu
{"title":"IaaS云中的任务延迟感知调度策略","authors":"T. M. A. Teresa, Niyas Ibrahim, K. R. R. Babu","doi":"10.1109/ICRTIT.2013.6844290","DOIUrl":null,"url":null,"abstract":"In Infrastructure as a Service cloud computational resources of different clouds within its federation can be used in the form of leases. This may result in tasks getting completed in other clouds that have more computational power or currently have free resources to service the request. In this paper a new task scheduling approach has been considered that not only considers the effective finish time of clouds as parameters similar to list scheduling, but also takes into account the latency of networks involved in the federation. This consideration is due to the fact that the estimated finish time may differ from actual finish time of tasks when there is a communication delay between clouds in the federation. When dependency among tasks are considered it becomes necessary that a dependent task can start execution only if its predecessors have completed. So if the predecessor task has been scheduled in a different cloud the calculation of estimated finish time with communication delay will help in finding the proper cloud to schedule the task. This would not be possible if the communication delay is not considered as a parameter in estimating the finish time of task. By this approach make-span time of an application which is a set of tasks can be considerably reduced. The experimental results show that the proposed method outperforms the existing list scheduling algorithm.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Latency aware scheduling policy for tasks in IaaS cloud\",\"authors\":\"T. M. A. Teresa, Niyas Ibrahim, K. R. R. Babu\",\"doi\":\"10.1109/ICRTIT.2013.6844290\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Infrastructure as a Service cloud computational resources of different clouds within its federation can be used in the form of leases. This may result in tasks getting completed in other clouds that have more computational power or currently have free resources to service the request. In this paper a new task scheduling approach has been considered that not only considers the effective finish time of clouds as parameters similar to list scheduling, but also takes into account the latency of networks involved in the federation. This consideration is due to the fact that the estimated finish time may differ from actual finish time of tasks when there is a communication delay between clouds in the federation. When dependency among tasks are considered it becomes necessary that a dependent task can start execution only if its predecessors have completed. So if the predecessor task has been scheduled in a different cloud the calculation of estimated finish time with communication delay will help in finding the proper cloud to schedule the task. This would not be possible if the communication delay is not considered as a parameter in estimating the finish time of task. By this approach make-span time of an application which is a set of tasks can be considerably reduced. The experimental results show that the proposed method outperforms the existing list scheduling algorithm.\",\"PeriodicalId\":113531,\"journal\":{\"name\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTIT.2013.6844290\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2013.6844290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在基础设施即服务云中,可以以租赁的形式使用其联盟内不同云的计算资源。这可能导致任务在具有更多计算能力或当前有空闲资源来服务请求的其他云中完成。本文提出了一种新的任务调度方法,该方法不仅将云的有效完成时间作为类似于列表调度的参数,而且考虑了联合网络的延迟。这种考虑是由于这样一个事实,即当联合中的云之间存在通信延迟时,估计的完成时间可能与任务的实际完成时间不同。当考虑任务之间的依赖关系时,依赖任务必须只有在其前一个任务完成后才能开始执行。因此,如果先前的任务被安排在不同的云中,那么计算带有通信延迟的估计完成时间将有助于找到合适的云来安排任务。如果在估计任务完成时间时不把通信延迟作为一个参数来考虑,这是不可能的。通过这种方法,应用程序(一组任务)的make-span时间可以大大减少。实验结果表明,该方法优于现有的列表调度算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Latency aware scheduling policy for tasks in IaaS cloud
In Infrastructure as a Service cloud computational resources of different clouds within its federation can be used in the form of leases. This may result in tasks getting completed in other clouds that have more computational power or currently have free resources to service the request. In this paper a new task scheduling approach has been considered that not only considers the effective finish time of clouds as parameters similar to list scheduling, but also takes into account the latency of networks involved in the federation. This consideration is due to the fact that the estimated finish time may differ from actual finish time of tasks when there is a communication delay between clouds in the federation. When dependency among tasks are considered it becomes necessary that a dependent task can start execution only if its predecessors have completed. So if the predecessor task has been scheduled in a different cloud the calculation of estimated finish time with communication delay will help in finding the proper cloud to schedule the task. This would not be possible if the communication delay is not considered as a parameter in estimating the finish time of task. By this approach make-span time of an application which is a set of tasks can be considerably reduced. The experimental results show that the proposed method outperforms the existing list scheduling algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信