An opportunistic algorithm for scheduling workflows on grids

N/ACitations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The execution of scientific workflows in Grid environments imposes many challenges due to the dynamic nature of such environments and the characteristics of scientific applications. This work presents an algorithm that dynamically schedules tasks of workflows to Grid sites based on the performance of these sites when running previous jobs from the same workflow. The algorithm captures the dynamic characteristics of Grid environments without the need to probe the remote sites. We evaluated the algorithm running a workflow in the Open Science Grid using twelve sites. The results showed improvements up to 150% relative to other four usual scheduling strategies. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Meyer, L., Scheftner, D., Vöckler, J., Mattoso, M., Wilde, M., & Foster, I. (2007). An opportunistic algorithm for scheduling workflows on grids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4395 LNCS, pp. 1–12). Springer Verlag. https://doi.org/10.1007/978-3-540-71351-7_1

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