Improving Max-Min scheduling Algorithm for Reducing the Makespan of Workflow Execution in the Cloud
Author(s) -
Ali S.
Publication year - 2017
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2017915684
Subject(s) - computer science , workflow , cloud computing , job shop scheduling , scheduling (production processes) , algorithm , distributed computing , database , mathematical optimization , operating system , schedule , mathematics
Cloud computing has become a new paradigm that provides IT resources as a service based on the basis: pay-per-use over the internet. Scientific workflow applications can gain the advantage by running on cloud resources. However, the optimized of workflow scheduling algorithms is a challenge and still needed further work. This paper presents an improved Max-Min algorithm based on the Max-Min algorithm. It can minimize the makespan of workflow execution and increases the resource utilization. The algorithm tested using WorkflowSim with five workflows from the Pegasus workflow management system. The results show that this algorithm can achieve better than Max-Min in most of the cases. General Terms Distributed Computer Systems, Algorithms.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom