A simple model that can be used for the representation of certain workflows is a directed acyclic graph. Although many heuristics have been proposed to schedule such graphs on heterogeneous environments, most of them assume accurate prediction of computation and communication costs; this limits their direct applicability to a dynamically changing environment, such as the Grid. To deal with this, run-time rescheduling may be needed to improve application performance. This paper presents a low-cost rescheduling policy, which considers rescheduling at a few, carefully selected points in the execution. Yet, this policy achieves performance results, which are comparable with those achieved by a policy that dynamically attempts to reschedule before the execution of every task. © Springer-Verlag 2004.
CITATION STYLE
Zhao, H., & Sakellariou, R. (2004). A low-cost rescheduling policy for dependent tasks on grid computing systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3165, 21–31. https://doi.org/10.1007/978-3-540-28642-4_3
Mendeley helps you to discover research relevant for your work.