The resource scheduling algorithms with QoS for grid computing based on EHLTCPN

Resource scheduling is an integrated part of parallel and distributed computing. With the emergence of grid computing, newer challenges have arisen in resource scheduling. In grid computing environment, the scheduling problem, especially the scheduling problem with Quality of Service (QoS), becomes complex, as resources are geographically distributed, heterogeneous in nature. Petri nets have gained more and more applications, as they have abilities to model asynchronous events, parallelism, connection, and synchronization. An extended high-level timing constraint Petri net (EHLTCPN) model is presented in this paper. In the EHLTCPN, the latest firing times of time intervals and firing durations assigned to transitions are functions of time. A simple EHLTCPN model for the resource scheduling within deadline and budget in grid computing environment is constructed. A definition of Reachable Scheduling Graph (RSG) to analyze the timing property of the resource scheduling is given in this paper. Two resource scheduling algorithms with QoS are presented based on heuristics. The resource scheduling algorithms with QoS attempted to complete the allocation of jobs to resource as economically and/or quickly as possible.