{"title":"考虑威布尔故障分布的电网故障感知调度","authors":"Manjeet Singh, R. Garg","doi":"10.1109/ICRTIT.2013.6844183","DOIUrl":null,"url":null,"abstract":"In Grid computing environment, as the resources are more heterogeneous, geographically distributed, complex and owned by different organizations, they are more prone to failures. Application scheduling in such a environment is very crucial. Generally, during application/job scheduling only performance factor of resources are considered. But if a node with high computational power also have high failure rate, then there is no such benefit of allocating task to that node because every time a failure occurs it needs recovery and in turn costs in term of time. Thus, failure increases make-span for the job and decreases system/node performance. A node with comparatively lower computational capacity and lower failure rate may give better performance and reduced make-span. So it would be a great idea if we take into consideration failure rate and computational capacity of resources during scheduling. In this paper we have proposed an approach for scheduling the tasks. We recalculate the computational capacity of resources by finding the expected wasted time due to presence of failure and then the tasks are scheduled according to this new computational capacity. Here the failure of nodes is treated as to follow Weibull distribution.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Failure-aware scheduling in grid considering Weibull failure distribution\",\"authors\":\"Manjeet Singh, R. Garg\",\"doi\":\"10.1109/ICRTIT.2013.6844183\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Grid computing environment, as the resources are more heterogeneous, geographically distributed, complex and owned by different organizations, they are more prone to failures. Application scheduling in such a environment is very crucial. Generally, during application/job scheduling only performance factor of resources are considered. But if a node with high computational power also have high failure rate, then there is no such benefit of allocating task to that node because every time a failure occurs it needs recovery and in turn costs in term of time. Thus, failure increases make-span for the job and decreases system/node performance. A node with comparatively lower computational capacity and lower failure rate may give better performance and reduced make-span. So it would be a great idea if we take into consideration failure rate and computational capacity of resources during scheduling. In this paper we have proposed an approach for scheduling the tasks. We recalculate the computational capacity of resources by finding the expected wasted time due to presence of failure and then the tasks are scheduled according to this new computational capacity. Here the failure of nodes is treated as to follow Weibull distribution.\",\"PeriodicalId\":113531,\"journal\":{\"name\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"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.6844183\",\"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.6844183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Failure-aware scheduling in grid considering Weibull failure distribution
In Grid computing environment, as the resources are more heterogeneous, geographically distributed, complex and owned by different organizations, they are more prone to failures. Application scheduling in such a environment is very crucial. Generally, during application/job scheduling only performance factor of resources are considered. But if a node with high computational power also have high failure rate, then there is no such benefit of allocating task to that node because every time a failure occurs it needs recovery and in turn costs in term of time. Thus, failure increases make-span for the job and decreases system/node performance. A node with comparatively lower computational capacity and lower failure rate may give better performance and reduced make-span. So it would be a great idea if we take into consideration failure rate and computational capacity of resources during scheduling. In this paper we have proposed an approach for scheduling the tasks. We recalculate the computational capacity of resources by finding the expected wasted time due to presence of failure and then the tasks are scheduled according to this new computational capacity. Here the failure of nodes is treated as to follow Weibull distribution.