{"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}
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.