Resource scheduling model for grid computing based on sharing synthesis of Petri net

In grid computing environment, although some resource scheduling heuristics were proposed, graphic representation and formal description for resource scheduling have not given more attention. In this paper, we first give a resource scheduling framework with three-level for grid computing environments. The differences between the framework and present frameworks are: (a) all tasks are submitted to home scheduler in stead of grid scheduler at themselves sites in the framework, which shows the autonomy of grid resource and is convenient for user to submit and supervise tasks; (b) the framework adds local scheduler between home scheduler and grid scheduler, which not only lightens the pressure of grid scheduler, but also makes tasks be possibly executed in local area. Then, a high-level timed Petri net to model the workflow of grid tasks is proposed. We construct different Petri net models for different scheduling levels. A Petri net model for whole system is gotten by sharing synthesis of Petri nets. Finally, we get some important results such as throughput, load balance and makespan on resource scheduling by analyzing reachability of Petri nets.