Open AccessA priority based on min-min algorithm for reducing make span task scheduling in cloud computing
Author(s) -
Abdulrahman Mohammed Hussein Obaid,
Santosh Kumar Pani,
Prasant Kumar Pattnaik
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.16300
Subject(s) - computer science , cloud computing , priority inversion , task (project management) , scheduling (production processes) , algorithm , earliest deadline first scheduling , deadline monotonic scheduling , priority inheritance , distributed computing , dynamic priority scheduling , rate monotonic scheduling , mathematical optimization , mathematics , computer network , operating system , engineering , quality of service , systems engineering
This paper proposes a two-phase technique for task scheduling which works on third-party broker. The priority algorithm is executed by selecting the task that has the highest priority. However, if more than one task has the same priority; it goes to second phase to execute the traditional Min-Min algorithm. Experiments are conducted by considering random tasks in order to compare the performance of the pro-posed algorithm with the Min-Min algorithm. The recorded experimental outcomes indicate that the proposed technique is given 10% better results as compared to the traditional Min-Min algorithm.