JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Analysis Task Scheduling Models based on Hierarchical Timed Marked Graph
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Analysis Task Scheduling Models based on Hierarchical Timed Marked Graph
Ro, Cheul-Woo; Cao, Yang;
  PDF(new window)
 Abstract
Task scheduling is an integrated component of computing with the emergence of grid computing. In this paper, we address two different task scheduling models, which are static Round-Robin (RR) and dynamic Fastest Site First (FSF) task scheduling method, using extended timed marked graphs, which is a special case of Stochastic Petri Nets (SPN). Stochastic reward nets (SRN) is an extension of SPN and provides compact modeling facilities for system analysis. We build hierarchical SRN models to compare two task scheduling methods. The upper level model simulates task scheduling and the lower level model implements task serving process for different sites with multiple servers. We compare these two models and analyze their performances by giving reward measures in SRN.
 Keywords
Task Scheduling;SRN;Petri nets;Hierarchical Model;timed marked graph;
 Language
English
 Cited by
 References
1.
Xiao Shan He, Xianhe Sun, Gregor von Laszewski, "QoS guided Min-Min heuristic for grid task scheduling," Journal of Computer Science and Technology, vol. 18(4), 2003, pp. 442-451.1 crossref(new window)

2.
Peijie Huang, Hong Peng, Piyuan Lin, Xuezhen Li, "Static strategy and dynamic adjustment: An effective method for grid task scheduling", Future Generation Computer Systems 25, 2009, pp. 884-892 crossref(new window)

3.
W. M. Zuberek and W. Kubiak, "Timed Petri Nets in Modeling and Analysis of Simple Schedules for Manufacturing Cells", Computers and Mathematics with Applications 37, 1999, pp. 191-206. crossref(new window)

4.
Yossi Malka,Sergio Rajsbaum, "Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version)," Lecture Notes In Computer Science; Proceedings of the 5th International Workshop on Distributed Algorithms ,vol. 579,1991, pp. 242-253. crossref(new window)

5.
Shimohata, H., S. Kataoka and T. Yamada, "A resource allocation problem on timed marked graphs: a decomposition approach," International Journal of Systems Science, vol. 27, 1996, pp. 405-411. crossref(new window)

6.
G. Ciardo, A. Blakemore, P.F. Chimento, and K.S. Trivedi, "Automated Generation and Analysis of Markov Reward Models Using Stochastic Reward Nets", Linear Algebra, Markov Chains, and Queueing Models, IMA Volumes in Math. and its Applications, A. Friedman and J.W. Miller, eds., vol. 48, pp. 145-191.Heidelberg, Germany: Springer-Verlag, 1993. crossref(new window)

7.
Miguel Felder, Angelo Gargantinib, Angelo Morzentib, " A theory of implementation and refinement in timed Petri nets," Theoretical Computer Science 202, 1998, pp. 127-161.

8.
Branislav Hruz,MengChu Zhou, "Modeling and Control of Discrete-event Dynamic Systems: with Petri Nets and Other Tools (Advanced Textbooks in Control and Signal Processing)," ISBN: 184628872X,2007,vol. 178.

9.
Jogesh Muppala, Gianfranco Ciardo, and K. S. Trivedi, "Stochastic Reward Nets for Reliability Prediction, Communications in Reliability, Maintainability and Serviceability", An International Journal published by SAE International, vol. 1, no. 2, July 1994.

10.
Cheul Woo Ro, Kyung Min Kim. " Stochastic Petri Nets Modeling Methods of Channel Allocation in Wireless Networks," IJOC(International Journal of Contents) vol. 4, no.3, 2008.9

11.
K. S. Trivedi, J. K. Muppala, S. P. Woolet, and B. R.Haverkort, "Composite performance and dependability analysis", Performance Evaluation, vol 14, no. 3, 1992, pp. 197–215. crossref(new window)

12.
A. Bobbio, K.S. Trivedi, "An aggregation technique for the transient analysis of stiff Markov chains," IEEE Transactions on Computers 35(9), 1986, pp. 803-814. crossref(new window)

13.
Cheul Woo Ro, Yang Cao, Yun Xiang Ye, Wei Xu, "Task Scheduling Modeling using Timed Marked Graph," Proceeding of KIMICS, 2010.5.