Performance Analysis of Job Scheduling Policy for Interference Avoidance Using Stochastic Petri Nets

Takashi KOBAYASHI
Kenzo KURIHARA

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E74-A    No.10    pp.3144-3151
Publication Date: 1991/10/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Issue on Petri Nets and Discrete Event Systems)
Category: 
Keyword: 


Full Text: PDF>>
Buy this Article



Summary: 
In many parallel processing systems, interference among jobs, which comes from resource contention, causes performance degradation. In order to solve the problem of resource contention, an important question is: "How shall we optimize jop scheduling policy?" However, the traditional queuing theory assuming a first-come-first-served policy is not suitable for analyzing scheduling policy. A new method called Stochastic Petri Nets (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, the describing powers of places and transitions, elements of SPN, are as weak as Assembler in program languages. If we model scheduling logic in detail with SPN, that model becomes huge with a great number of places and transitions. Not only modeling of scheduling logic itself becomes difficult, but also analyzing of the model becomes difficult. In this paper, we consider a system in which resource contention causes job interference, and propose a method of analyzing scheduling policy for interference avoidance. In this method, for each scheduling policy, we introduce functions between job execution performance and system states. By incorporating this function into a SPN model, we cut down the size of the model. We apply the proposed method to analyzing performance of the control policy of a magnetic tape library, and show the efficiency and limit of this method.