Resource scheduling scheme for grid computing and its petri net model and analysis

Authors:
Yaojun Han;Changjun Jiang;Xuemei Luo
Affiliations:
College of International Business Administration, Shanghai International Studies University, Shanghai, China;Department of Computer Science & Engineering, Tongji University, Shanghai, China;College of International Business Administration, Shanghai International Studies University, Shanghai, China
Venue:
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 4
Cited 0

Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1

Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The resource scheduling problem becomes complex, as resources are distributed, heterogeneous, dynamic and autonomous. A resource scheduling scheme with three-level for grid computing is proposed in this paper by analyzing present resource scheduling scheme. Petri net is a powerful graphical and mathematics tool for describing the concurrent, asynchronous and dynamic events. This paper models and analyzes the resource scheduling scheme of grid computing using hierarchical Petri net. Different Petri net models for resource scheduling of different layers are given in this paper. Petri model for different layer has different behavior, which represents heterogeneous and autonomous features of grid computing resources. Finally, we get some important results such as throughput, load balance and makespan on resource scheduling by analyzing reachability of Petri nets.