Performance model of interference avoidance policy using stochastic Petri nets

Author

Kobayashi, Takashi ; Kurihara, Kenzo

Author_Institution

Syst. Dev. Lab., Hitachi Ltd., Kawasaki, Japan

fYear

1991

fDate

2-5 Dec 1991

Firstpage

125

Lastpage

133

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

Keywords

Petri nets; parallel processing; performance evaluation; scheduling; stochastic automata; combinatorial explosion; interference avoidance policy; job arrival states; magnetic tape library; performance model; resource assignment states; scheduling logic; scheduling policy; stochastic Petri nets; Interference; Libraries; Logic; Magnetic analysis; Parallel processing; Petri nets; Power system modeling; Processor scheduling; Stochastic processes; Stochastic systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Petri Nets and Performance Models, 1991. PNPM91., Proceedings of the Fourth International Workshop on

Conference_Location

Melbourne, Vic.

Print_ISBN

0-8186-2285-7

Type

conf

DOI

10.1109/PNPM.1991.238775

Filename

238775