Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms

358Citations
Citations of this article
122Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models, which are capable of supporting diverse computing services. It facilitates scientific applications to take advantage of computing resources distributed world wide to enhance the capability and performance. Many scientific applications in areas such as bioinformatics and astronomy require workflow processing in which tasks are executed based on their control or data dependencies. Scheduling such interdependent tasks on utility Grid environments need to consider users' QoS requirements. In this paper, we present a genetic algorithm approach to address scheduling optimization problems in workflow applications, based on two QoS constraints, deadline and budget. © 2006 - IOS Press and the authors. All rights reserved.

Cite

CITATION STYLE

APA

Yu, J., & Buyya, R. (2006). Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Scientific Programming, 14(3–4), 217–230. https://doi.org/10.1155/2006/271608

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