Reducing Rejected Workflows using WSHF Algorithm in Cloud

Workflow ensembles of interdependent tasks for a larger scale application have to be managed efficiently to get accurate results within a stipulated time and it is a challenging task. In this paper, we address a problem of efficient scheduling of workflow ensembles within the budget and deadline constraints and also the workflow ensembles that deviates the budget and deadline constraints. We consider the benefits of both the resource providers and the users in our paper. We simulate our work and analyze the performance of our paper using cloudsim. The incoming tasks with respect to any criteria are admitted based on the admission and feedback procedure. The proposed work also concentrates on the workflows that is of beyond the budget and deadline The tasks that are within the budget and deadline criteria are handled directly and admitted by the queue, whereas the tasks that isof beyond the budget and deadline are readmitted by Workflow Shuffling and Hole Filling Algorithm (WSHFA). The algorithm achieves the minimization of rejected tasks by recycling it, thereby reducing the idleness of resources and maximizing the resource utilization in cloud.