Task migration enabling grid workflow application rescheduling

7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper focuses on the task migration enabling grid workflow application rescheduling problem, presents a reduced task graph model, and implements a performance oriented rescheduling algorithm based on immune genetic algorithm. The experiment shows that, compared with Adaptive Heterogeneous Earliest Finish Time static rescheduling algorithm and the classical dynamic Max-Min scheduling algorithm, the performance advantage of the proposed rescheduling algorithm is obvious, on the one hand because of the performance contribution of global optimization and task migration, and on the other hand because of the efficiency contribution of task graph reduction and immune genetic algorithm's convergent speed. It also shows that task migration improves grid application's adaptability of dynamics further. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hao, X., Dai, Y., Zhang, B., & Chen, T. (2008). Task migration enabling grid workflow application rescheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4976 LNCS, pp. 130–135). https://doi.org/10.1007/978-3-540-78849-2_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free