Performance model of interference avoidance policy using stochastic Petri nets

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.<>