Improved Max-Min Algorithm in Cloud Computing

  • M.Elzeki O
  • Z. Reshad M
  • A. Elsoud M
N/ACitations
Citations of this article
47Readers
Mendeley users who have this article in their library.

Abstract

In this paper, a unique modification of Max-min algorithm is proposed. The algorithm is built based on comprehensive study of the impact of RASA algorithm in scheduling tasks and the atom concept of Max-min strategy. An Improved version of Max-min algorithm is proposed to outperform scheduling map at least similar to RASA map in total complete time for submitted jobs. Improved Max-min is based on the expected execution time instead of complete time as a selection basis. Experimental results show availability of load balance in small cloud computing environment and total small makespan in large-scale distributed system; cloud computing. In turn scheduling tasks within cloud computing using Improved Max-min demonstrates achieving schedules with comparable lower makespan rather than RASA and original Max-min.

Cite

CITATION STYLE

APA

M.Elzeki, O., Z. Reshad, M., & A. Elsoud, M. (2012). Improved Max-Min Algorithm in Cloud Computing. International Journal of Computer Applications, 50(12), 22–27. https://doi.org/10.5120/7823-1009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free