International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 50 - Issue 12 |
Published: July 2012 |
Authors: O. M. Elzeki, M. Z. Reshad, M. A. Elsoud |
![]() |
O. M. Elzeki, M. Z. Reshad, M. A. Elsoud . Improved Max-Min Algorithm in Cloud Computing. International Journal of Computer Applications. 50, 12 (July 2012), 22-27. DOI=10.5120/7823-1009
@article{ 10.5120/7823-1009, author = { O. M. Elzeki,M. Z. Reshad,M. A. Elsoud }, title = { Improved Max-Min Algorithm in Cloud Computing }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 50 }, number = { 12 }, pages = { 22-27 }, doi = { 10.5120/7823-1009 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A O. M. Elzeki %A M. Z. Reshad %A M. A. Elsoud %T Improved Max-Min Algorithm in Cloud Computing%T %J International Journal of Computer Applications %V 50 %N 12 %P 22-27 %R 10.5120/7823-1009 %I Foundation of Computer Science (FCS), NY, USA
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.