The Community for Technology Leaders
Proceedings of the Fourth International Workshop on Petri Nets and Performance Models (1991)
Melbourne, Victoria, Australia
Dec. 2, 1991 to Dec. 5, 1991
ISBN: 0-8186-2285-7
pp: 125-133
T. Kobayashi , Syst. Dev. Lab., Hitachi Ltd., Kawasaki, Japan
K. Kurihara , Syst. Dev. Lab., Hitachi Ltd., Kawasaki, Japan
ABSTRACT
A new method is described for analyzing scheduling policy for interference avoidance. The traditional queuing theory assuming a first-come-first-served policy is not suitable for analyzing scheduling policy. Stochastic Petri net (SPN) is suitable for analyzing scheduling policy, because with it job arrival states, resource assignment states, and job flow due to these states can be modeled. However, if the scheduling logic is described in detail with SPN, a combinatorial explosion is soon encountered. Therefore, a new method is proposed to cut down the size of SPN model and to analyze the control policy of a magnetic tape library.<>
INDEX TERMS
parallel processing, performance evaluation, Petri nets, scheduling, stochastic automata
CITATION

T. Kobayashi and K. Kurihara, "Performance model of interference avoidance policy using stochastic Petri nets," Proceedings of the Fourth International Workshop on Petri Nets and Performance Models(PNPM), Melbourne, Victoria, Australia, , pp. 125-133.
doi:10.1109/PNPM.1991.238775
84 ms
(Ver 3.3 (11022016))