In a grid computing, task execution time is dependent on the machine to which it is assigned and task precedence constraints represented by a directed acyclic graph. In this paper we propose a hybrid assignment strategy of dependent tasks in Grids which integrated static and dynamic assignment technologies. We consider that a grid computing is a set of clusters formed by a set of computing elements and a cluster manager. Our main objective is to arrive at task assignment that could achieve minimum response time and to reduce the transfer cost inducing by the tasks transfer respecting the dependency constraints. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Meriem, M., & Belabbas, Y. (2010). Dynamic dependent tasks assignment for grid computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6082 LNCS, pp. 112–120). https://doi.org/10.1007/978-3-642-13136-3_11
Mendeley helps you to discover research relevant for your work.