Skip to main content
SpringerLink
Log in

General scheduling framework in computational Grid based on Petri net

  • Electro-Mechanical Engineering And Information Science
  • Published:
Journal of Central South University of Technology Aims and scope Submit manuscript

Abstract

A general scheduling framework (GSF) for independent tasks in computational Grid is proposed in this paper, which modeled by Petri net and located on the layer of Grid scheduler. Furthermore, a new mapping algorithm aimed at time and cost is designed on the basis of this framework. The algorithm uses weighted average fuzzy applicability to express the matching degree between available machines and independent tasks. Some existent heuristic algorithms are tested in GSF, and the results of simulation and comparison not only show good flexibility and adaptability of GSF, but also prove that, given a certain aim, the new algorithm can consider the factors of time and cost as a whole and its performance is higher than those mentioned algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Raman R, Livny M, Solomon M. Matchmaking: distributed resource management for high throughput computing[A]. Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing [C]. DC: IEEE Computer Society Press, 1998. 140–146.

    Google Scholar 

  2. WU Min-you, SHU Wei. Segmented Min-Min: a static mapping algorithm for meta-tasks on heterogeneous computing systems[A]. Proceedings of 9th Heterogeneous Computing Workshop (HCW 2000)[C]. 2000. 375–385.

  3. HU Zhi-gang, ZHONG Jue. Research on theory and method in parallel designing environment based on coupling[J]. Journal of CSUT, 2002, 9(2): 123–127.

    Google Scholar 

  4. Braun T D, Siegel H J, et al. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing system [J]. Journal of Parallel and Distributed Computing, 2001, 6: 810–837.

    Article  Google Scholar 

  5. Armstrong R, Hensgen D, Kidd T. The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions[A]. Proceedings of 7th IEEE Heterogeneous Computing Workshop (HCW ’98)[C]. 1998. 79–87.

  6. Tracy D. Braun A. Comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems[A]. Proceedings of the Eighth Heterogeneous Computing Workshop[C]. 1999. 19–29.

  7. Murata T. Petri nets: properties, analysis and applications[A]. Proceedings of the IEEE[C]. 1989. 541–580.

    Article  Google Scholar 

  8. HU Zhi-gang, MA Hao, WANG Guo-jun. A reliable routing algorithm in mobile ad hoc networks using fuzzy petri net[A]. Proceeding of IEEE Communications Society Globecom 2004 Workshops[C]. 2004. 80–84.

  9. Chen S M, Ke J S, Chang J F. Knowledge representation using fuzzy Petri nets[J]. IEEE Transactions on Knowledge and Data Engineering, 1990, 2(3): 311–319.

    Article  Google Scholar 

  10. JIN Hai, CHEN Gang, ZHAO Mei-ping. Research on a job scheduling model for fault tolerant computational grid[J]. Journal of Compu Ter Research and Development, 2004, 41(8): 1382–1388. (in Chinese)

    Google Scholar 

  11. Zuberek W M. Timed petri nets: definitions, properties and applications[J]. Microelectronics and Reliability, 1991, 32(4): 627–644.

    Article  Google Scholar 

  12. Zhuo L U, Alexander H L. A colored petri net model of distributed tactical decision making[A]. Proceedings of 1991 IEEE/SMC International Conference on Systems[C]. 1991. 2035–2040.

  13. Beaven M, Marinescu D, Stansifer R. Critical path analysis of concurrent ada programs using colored petri nets: rewrite rules[A]. Proceedings of ISCAS 1991, Intl. Symp. Circuits and Systems[C]. 1991. 144–152.

  14. Miner A S. Computing response time distributions using stochastic petri nets and matrix diagrams[A]. Proceedings of 10th International Workshop on Petri Nets and Performance Models (PNPM 2003) [C]. 2003. 10–19.

  15. HAN Yao-jun, JIANG Chang-jun, et al. Resource scheduling algorithms for grid computing and its modeling and analysis using petri net[A]. Proceedings of GCC (2)[C]. 2003. 73–80.

  16. YAN Jia-jie. Fuzzy applicability and weighted average applicability of F sets[J]. Journal of Zhengzhou Institute of Technology, 1994, 15(2): 89–91. (in Chinese)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Hu Zhi-gang (Professor), Hu Rong, Gui Wei-hua, Chen Jian-er & Chen Song-qiao

Authors
  1. Hu Zhi-gang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hu Rong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gui Wei-hua
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chen Jian-er
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Chen Song-qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hu Zhi-gang.

Additional information

Foundation item: Project (60433020) supported by the National Natural Science Foundation of China; project supported by the Postdoctoral Science Foundation of Central South University

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, Zg., Hu, R., Gui, Wh. et al. General scheduling framework in computational Grid based on Petri net. J Cent. South Univ. Technol. 12 (Suppl 1), 232–237 (2005). https://doi.org/10.1007/s11771-005-0405-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-005-0405-2

Key words

CLC number

Search

Navigation