Job migration with fault tolerance based QoS scheduling using hash table functionality in social Grid computing

Abstract

In this paper, a fault tolerance based QoS (Quality of Services) scheduling using HTF (Hash Table Functionality) in Social Grid Computing (SGC) is introduced, where HTF is used as the underlying mechanism in SGC to logically manage the locations of the devices. Fault tolerance based QoS scheduling consists of four sub-scheduling algorithms: Unauthorized-user filtering, Grid service delivery, QoS provisioning, and Replication and load-balancing. Under the proposed scheduling, a device is used as a resource for providing Grid services, faults caused due to reason like user mobility are tolerated and user requirements for QoS are considered. Simulations include the scheduling by with and without HTF. The simulation results show that our proposed scheduling algorithm enhances Grid service execution time, finish time, reliability and reduces the Grid service error rate.