Divisible Task Scheduling in Mobile Grid

Scheduling problem of independent tasks with same length on a group of fixed and mobile resources is studied.These resources are heterogeneous and dynamic in performance and mobile devices with intermittent connectivity.Dynamic circulation scheduling algorithm (DCS) is proposed in which tasks are organized in ring structure and schedule process reflects re-scheduling strategy as well as replication strategy.Performance analysis and experimental verification of DCS are provided, showing that algorithm performance is related to communication environment, tasks span, the number of mobile resources and task length.