A Novel Heuristic Max Ratio based Workflow Scheduling Algorithm for Cloud

Abstract Workflow Scheduling Algorithm (WSA) for the cloud is one of the most trending issues in the research community. This is a Non-deterministic Polynomial (NP) complete problem. WSA has become more challenging due to the computation of valid sequences for dependent tasks by preserving precedence relationships. Here, a novel Heuristic Max Ratio Workflow Scheduling Algorithm (HMRWSA) is designed using the max ratio constraint as transfer delay and computation time of workflow applications. The proposed HMRWSA enhances the performance measure in terms of a number of conflicting objectives such as schedule length, energy consumption, utilization of virtual machines and speed-up ratio. Various scientific or benchmark workflow applications(WA) data sets are used to extensively simulate the algorithm. In terms of schedule length, utilisation, and spreedup ratio, the simulation results are compared to reputed heuristic approaches such as Critical-Path-on-Processor (CPOP), Heuristic Earliest Finish Time-Top (HEFT-T), Heuristic Earliest Finish Time-Button (HEFT-B), Performance Effective Task (PET), and Predict Earliest Finish Time (PEFT).