A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
ASKALON: a tool set for cluster and Grid computing: Research Articles
Concurrency and Computation: Practice & Experience - Grid Performance
A modeling and executive environment for distributed scientific workflows
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Taverna: lessons in creating a workflow environment for the life sciences: Research Articles
Concurrency and Computation: Practice & Experience - Workflow in Grid Systems
Scientific workflow management and the Kepler system: Research Articles
Concurrency and Computation: Practice & Experience - Workflow in Grid Systems
Pegasus: A framework for mapping complex scientific workflows onto distributed systems
Scientific Programming
Conditional workflow management: A survey and analysis
Scientific Programming - Dynamic Computational Workflows: Discovery, Optimization and Scheduling
Flexible and Efficient Workflow Deployment of Data-Intensive Applications On Grids With MOTEUR
International Journal of High Performance Computing Applications
A biochemical approach to adaptive service ecosystems
Information Sciences: an International Journal
A Bi-criteria Algorithm for Scheduling Parallel Task Graphs on Clusters
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Auto-scaling to minimize cost and meet application deadlines in cloud workflows
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
A Chemistry-Inspired Workflow Management System for Scientific Applications in Clouds
ESCIENCE '11 Proceedings of the 2011 IEEE Seventh International Conference on eScience
Hi-index | 0.00 |
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.