Cooperative and decentralized workflow scheduling in global grids
Future Generation Computer Systems
Reputation-based dependable scheduling of workflow applications in Peer-to-Peer Grids
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cost optimized provisioning of elastic resources for application workflows
Future Generation Computer Systems
Toward fine-grained online task characteristics estimation in scientific workflows
WORKS '13 Proceedings of the 8th Workshop on Workflows in Support of Large-Scale Science
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
Workflow technologies have become a major vehicle for the easy and efficient development of science applications. At the same time new computing environments such as the Cloud are now avaiable. A challenge is to determine the right amount of resources to provision for an application. This paper introduces an algorithm named Balanced Time Scheduling (BTS), which estimates the minimum number of virtual processors required to execute a workflow within a user-specified finish time. The resource estimate of BTS is abstract, so it can be easily integrated with any resource description language or any resource provisioning system. The experimental results with a number of synthetic workflows demonstrate that BTS can estimate the computing capacity close to the optimal. The algorithm is scalable so that its turnaround time is only tens of seconds even with workflows having thousands of tasks and edges.