DocumentCode
2288306
Title
Exploiting deadline flexibility in Grid workflow rescheduling
Author
Chen, Wei ; Fekete, Alan ; Lee, Young Choon
Author_Institution
Sch. of Inf. Technol., Univ. of Sydney, Sydney, NSW, Australia
fYear
2010
fDate
25-28 Oct. 2010
Firstpage
105
Lastpage
112
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.
Keywords
greedy algorithms; grid computing; scheduling; deadline based strategy; exploiting deadline flexibility; greedy algorithm; grid workflow rescheduling; heterogeneous Grid system; rescheduling workflow applications; scheduling workflow applications; temporal constraints; time slot boundaries; Availability; Bandwidth; Computational modeling; Job shop scheduling; Processor scheduling; Schedules; Grid Computing; Rescheduling; Workflow;
fLanguage
English
Publisher
ieee
Conference_Titel
Grid Computing (GRID), 2010 11th IEEE/ACM International Conference on
Conference_Location
Brussels
Print_ISBN
978-1-4244-9347-0
Type
conf
DOI
10.1109/GRID.2010.5697962
Filename
5697962
Link To Document