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, two scheduling algorithms called AMOF and AMOSF are proposed. Both of them consider availability variation as well as resource heterogeneity while scheduling an ongoing workflow application on the grid. An experiment has been conducted to demonstrate that AMOF and AMOSF algorithms outperform the well-known scheduling algorithms: GS and HEFT 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