An Efficient Analysis of the Grid Scheduling Methods on Cloud Network
|JYOTI VERMA1 , HEENA GULATI2, HARISH KUNDRA3
|Related article at Pubmed, Scholar Google|
Cloud Computing is an emerging field which a lot of hopes and possibilities in each and every sector whether it is corporate, IT , finance or any other filed . Every one want to keep their data safe. The days are not so very far when the overall working environment would be shifted to cloud. In such a case it becomes a critical need to analyze the cloud server whether it suits our need or not. Grid Computing is an area which is familiar with everyone in the scheduling filed .A scheduler schedules the job according to algorithm provided to the scheduler . This paper focuses on the working of different algorithm structure of scheduling like First Come First Serve , Priority , Round Robin and their performance analysis on the cloud network. This paper also focuses over the possibilities of the combination of these few algorithms and the previously successful combination for the same .