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

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Han, Y., Jiang, C., & Luo, X. (2005). Resource scheduling scheme for grid computing and its petri net model and analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3759 LNCS, pp. 530–539). https://doi.org/10.1007/11576259_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free