摘要:In the multiprocessor environment the number of jobs arriving to the processor of CPU at a time is very large which causes a long waiting queue. In the processor when any conflict arises due to shared resources or overlap of instructions or any logical error, the deadlock state appears where processing of jobs is blocked completely. As the scheduler has jumps from one job to another in order to perform the processing work the transition mechanism appears. This paper presents a general transition scenario for the functioning of CPU scheduler in the presence of deadlock condition. A data model based Markov chain model is proposed to study the transition phenomenon and a general class of scheduling scheme is designed. Some specific schemes are treated as its particular cases and are compared under the setup of model through a proposed deadlock index measure. Simulation study is performed to evaluate the comparative merits of specific schemes of the class designed with the help of varying values of α and d.
关键词:Process scheduling; Markov chain model; Data model; State of system; Rest ; State; Deadlock State; Process queue; Multi-level queue scheduling; Transition ; probability matrix; Deadlock index