Abstract

Two distinct characteristics of grid computing systems are resource heterogeneity and availability variation There are many well-designed scheduling algorithms proposed for heterogeneous computing systems However, the availability variation is seldom considered in developing scheduling ongoing applications on a grid In this paper, a scheduling algorithm called AROF is proposed It considers availability variation as well as resource heterogeneity while scheduling applications to the grids An experiment has been conducted to demonstrate that AROF algorithm outperforms the well-known scheduling algorithms Modified HEFT and GS in most of the cases.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call