Analysis Task Scheduling Models based on Hierarchical Timed Marked Graph
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (13)
- Xiao Shan He, "QoS guided Min-Min heuristic for grid task scheduling", Journal of Computer Science and Technology, 18(4), pp.442~451 (2003)
- Peijie Huang, "Static strategy and dynamic adjustment: An effective method for grid task scheduling", Future Generation Computer Systems, 25, pp.884~892 (2009)
- W. M. Zuberek, "Timed Petri Nets in Modeling and Analysis of Simple Schedules for Manufacturing Cells", Computers and Mathematics with Applications, 37, pp.191~206 (1999)
- Yossi Malka, "Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version)", Lecture Notes In Computer Science; Proceedings of the 5th International Workshop on Distributed Algorithms, 통권 : 79, pp.242~253 (1991)
- Shimohata, H, "A resource allocation problem on timed marked graphs: a decomposition approach", International Journal of Systems Science, 27, pp.405~411 (1996)
- G. Ciardo, "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, 48, pp.145~191 (1993), Springer-Verlag
- Miguel Felder, "A theory of implementation and refinement in timed Petri nets", Theoretical Computer Science, 202, pp.127~161 (1998)
- Branislav Hrúz, "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, ~ (2007)
- Jogesh Muppala, "Stochastic Reward Nets for Reliability Prediction, Communications in Reliability, Maintainability and Serviceability", An International Journal published by SAE International, 1(2) (1994)
- 노철우, "Stochastic Petri Nets Modeling Methods of Channel Allocation in Wireless Networks", International Journal of Contents, 4(3), pp.20~28 (2008), 한국콘텐츠학회
- K. S. Trivedi, "Composite performance and dependability analysis", Performance Evaluation, 14(3), pp.197~215 (1992)
- A. Bobbio, "An aggregation technique for the transient analysis of stiff Markov chains", IEEE Transactions on Computers, 35(9), pp.803~814 (1986)
- Cheul Woo Ro, "Task Scheduling Modeling using Timed Marked Graph", Proceeding of KIMICS (2010)