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.
This work is support partially by projects of National Basic Research Program of China(973 Program)(2003CB316902, 2004CB318001-03), National Natural Science Fund (60125205, 90412013, 60473094), Shanghai Science & Technology Research Plan (04XD14016), and Science Research Funds of Shanghai International Study University.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foster, I., Kesselman, C. (eds.): The Grid: blueprint for new computing infrastructure. Morgan Kaufmann Publishers, San Francisco (1999)
Subramani, V., Kettimuthu, R., et al.: Distributed task scheduling on computational grids using multiple simultaneous requests. In: Proceedings of 11th IEEE International Symposium on High Performance Distributed Computing (HPDC 2002), Edinburgh, Scotland, July 24 - 26, pp. 359–366 (2002)
Maheswaran, M., Ali, S., et al.: Dynamic matching and scheduling of a cass of independent tasks onto heterogeneous computing systems. In: Proceedings of 8th IEEE Heterogeneous Computing Workshop (HCW 1999), San Juan, Puerto Rico, April 1999, pp. 30–44 (1999)
van der Aalst, W.M.P.: Petri net based scheduling., Computing Science Reports. No. 95, Eindhoven University of Technology (1995)
Da, Y., Bo, Z., Chen, C.: An approach to HPN model of the scheduling problem. Computer Research & Development 33(5), 321–328 (1996)
Murata, T.: Petri nets: properties, analysis and application. Proceedings of IEEE 77, 541–584 (1989)
Jensen, K.: Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 1, 2. Springer, Heidelberg (1996)
Zuberek, W.M.: Timed Petri nets: definitions, properties and applications. Microelectronics and Reliability 31(4), 627–644 (1991)
Han, Y., Jiang, C., Luo, X.: Resource Scheduling Model for Grid Computing Based on Sharing Synthesis of Petri Net. In: Shen, W.-m., Chao, K.-M., Lin, Z., Barthès, J.-P.A., James, A. (eds.) CSCWD 2005. LNCS, vol. 3865, pp. 367–372. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, Y., Jiang, C., Luo, X. (2005). Resource Scheduling Scheme for Grid Computing and Its Petri Net Model and Analysis. In: Chen, G., Pan, Y., Guo, M., Lu, J. (eds) Parallel and Distributed Processing and Applications - ISPA 2005 Workshops. ISPA 2005. Lecture Notes in Computer Science, vol 3759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576259_58
Download citation
DOI: https://doi.org/10.1007/11576259_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29770-3
Online ISBN: 978-3-540-32115-6
eBook Packages: Computer ScienceComputer Science (R0)