Study on Grid Scheduling of Super-Peer Model Based on QoS

In order to formally model and theoretically analyze grid scheduling of super-peer model, we propose a kind of new resource scheduling algorithm allowing a grid user to put forward the task´s expected execution deadline, cost limit and the weight parameters between them. Then, we use hierarchical colored and price timed Petri net to model and simulate the dynamic process of grid scheduling, mapping tasks, grid resources, super-peers and QoS constraints to the Petri net. Lastly, we construct reachable task graph of Petri net model to verify the effectiveness of the algorithm and analyze the system´s scheduling performance, such as throughout capacity, load-balancing, scheduling time and cost through an example. The study can provide a standard for evaluating grid systems of super-peer model.