Budget constrained resource allocation for non-deterministic workflows on an iaas cloud

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

Abstract

Many scientific applications are described through workflow structures. Due to the increasing level of parallelism offered by modern computing infrastructures, workflow applications now have to be composed not only of sequential programs, but also of parallel ones. Cloud platforms bring on-demand resource provisioning and pay-as-you-go billing model. Then the execution of a workflow corresponds to a certain budget. The current work addresses the problem of resource allocation for non-deterministic workflows under budget constraints. We present a way of transforming the initial problem into sub-problems that have been studied before. We propose two new allocation algorithms that are capable of determining resource allocations under budget constraints and we present ways of using them to address the problem at hand. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Caron, E., Desprez, F., Muresan, A., & Suter, F. (2012). Budget constrained resource allocation for non-deterministic workflows on an iaas cloud. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7439 LNCS, pp. 186–201). https://doi.org/10.1007/978-3-642-33078-0_14

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