Computer Science ›› 2014, Vol. 41 ›› Issue (7): 105-109.doi: 10.11896/j.issn.1002-137X.2014.07.021

Previous Articles     Next Articles

Petri Net-and Concurrent Scheduling Marking Graph-based Modeling and Analysis of Concurrent Tasks Scheduling

HAN Yao-jun   

  • Online:2018-11-14 Published:2018-11-14

Abstract: In cloud computing and grid computing environment,there is a need of powerful graphical and mathematics tools for modeling and analyzing concurrent tasks scheduling because these tasks have dynamic,distributed,and heterogeneous properties.Petri nets are promising tools for modeling and analyzing events that are characterized as being concurrent,asynchronous,and dynamic.The weighted timed Petri net(WTdPN) model for concurrent tasks was given in this paper.Reachable marking graph is a very important tool to analyze the dynamic properties of Petri nets,but the concurrent relation of transitions in Petri nets can not be represented by reachable marking graph.Especially,it is not convenient to analyze time performance of system modeled by Petri net for the reachable marking graph.This paper presented the concept of concurrent scheduling marking graph(CSMG) and gave an algorithm for constructing concurrent scheduling marking graph of WTdPN.Finally,we analyzed the time performance of parallel download system using CSMG of WTdPN.

Key words: Timed Petri net,Concurrent scheduling marking graph,Concurrent task,Modeling and analysis

[1] Foster I,Kesselman C,Tueche S.The Anatomy of the grid:ena-bling scalable virtual organizations[J].International Journal of High Performance Computing Applications,2001,15(3):200-222
[2] Weiss A.Computing in the Cloud[J].ACM Networker,2007,11:18-25
[3] Maheswaran M,Siegel H J,et al.Dynamic Matching and Sche-duling of a Class of Independent Tasks onto Heterogeneous Computing Systems[C]∥Proceedings of the 8th IEEE Hetero-geneous Computing Workshop.San Juan,Puerto Rico:IEEE Computer Society Press,1999:30-44
[4] Murata T.Petri Nets:Properties,Analysis and Application[J].Proceedings of IEEE,1989,77(4):541-584
[5] 吴哲辉.Petri网导论[M].北京:机械工业出版社,2006
[6] van der Aalst W M P.Petri net based scheduling,Computing Science Reports[R].No.95,Eindhoven University of Technology,1995
[7] 于达,张钹,陈陈.调度问题的HPN模型研究[J].计算机研究与发展,1996,33(5):321-328
[8] 熊曾刚,杨扬,曾明.基于Petri网的两阶段网格任务调度模型与分析[J].通信学报,2009,30(8):69-77
[9] 胡志刚,谌任,陈华全.一种改进的网格资源调度算法及其有色Petri网建模和分析[J].小型微型计算机系统,2007,28(2):229-232
[10] 韩耀军.基于QoS的信息网格资源调度的建模与分析[J].情报杂志,2010(4):146-150
[11] Zhang Jin-quan,Ni Li-na,Jiang Chang-jun.An Algorithm toConstruct Concurrent Reachability Graph of Petri Nets[J].Journal of Donghua University:Eng.Ed.,2004,21(3):180-184
[12] Zuberek W M.Timed Petri nets:definitions,properties and applications[J].Microelectronics and Reliability,1991,1(4):627-644

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!