Reliable RASA scheduling algorithm for grid environment

Grid computing collects physically distributed resources from tablets, smart phones etc. to super computers to perform job requests by customers. Job scheduling refers to allocating grid user jobs to resources. Job scheduling in such an environment is major problem. Efficient job scheduling algorithms are required to make efficient use of the marvelous capability of the grid. In addition to this grid user may decide QoS he wants. It is required to maintain a level to predict the resource reliability and application performance due to dynamic nature of grid computing environment. In such environment, selecting reliable resource is an important performance criterion for providing QoS. This paper introduces reliability requirement percentage of grid user to Max-Min, Min-Min and RASA along with their comparative study. Random reliability percentages have been considered to compare these three algorithms´ overall execution time and impact of reliability on execution time.