{"title":"Exploiting deadline flexibility in Grid workflow rescheduling","authors":"Wei Chen, A. Fekete, Young Choon Lee","doi":"10.1109/GRID.2010.5697962","DOIUrl":null,"url":null,"abstract":"We propose a novel deadline-based strategy in scheduling and rescheduling workflow applications on a heterogeneous Grid system. Instead of minimizing the makespan of a job by a greedy algorithm, our approach schedules tasks so that the overall job meets its deadline. The key innovation is how we allow some tasks to be rescheduled, in light of later job requests, to a different time slot or another resource instance; this can leave enough resource availability for more urgent tasks. In our rescheduling, tasks are rearranged individually within certain time slot boundaries so that the temporal constraints of each workflow are kept without needing to totally reconsider the schedules of other tasks. A performance study shows that more jobs can be finished before their deadlines and the overall resource utilization is improved. The rescheduling algorithm is efficient and scalable to large sets of tasks.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 11th IEEE/ACM International Conference on Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRID.2010.5697962","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
We propose a novel deadline-based strategy in scheduling and rescheduling workflow applications on a heterogeneous Grid system. Instead of minimizing the makespan of a job by a greedy algorithm, our approach schedules tasks so that the overall job meets its deadline. The key innovation is how we allow some tasks to be rescheduled, in light of later job requests, to a different time slot or another resource instance; this can leave enough resource availability for more urgent tasks. In our rescheduling, tasks are rearranged individually within certain time slot boundaries so that the temporal constraints of each workflow are kept without needing to totally reconsider the schedules of other tasks. A performance study shows that more jobs can be finished before their deadlines and the overall resource utilization is improved. The rescheduling algorithm is efficient and scalable to large sets of tasks.