Data Model Approach And Markov Chain Based Analysis Of Multi-Level Queue Scheduling

Journal of Applied Computer Science & Mathematics

卷:4

关键词: Process Scheduling;    Markov Chain Model;    Mathematical Model;    State of the System;    Rest State;    Process Queue;    Multilevel Queue Scheduling;    Transition Probability Matrix;    Central Processing Unit (CPU);    Row dependent data model;   

DOI  :  

来源: DOAJ

【 摘 要 】

There are many CPU scheduling algorithms inliterature like FIFO, Round Robin, Shortest-Job-First and so on.The Multilevel-Queue-Scheduling is superior to these due to itsbetter management of a variety of processes. In this paper, aMarkov chain model is used for a general setup of Multilevelqueue-scheduling and the scheduler is assumed to performrandom movement on queue over the quantum of time.Performance of scheduling is examined through a rowdependent data model. It is found that with increasing value of αand d, the chance of system going over the waiting state reduces.At some of the interesting combinations of α and d, it diminishesto zero, thereby, provides us some clue regarding better choice ofqueues over others for high priority jobs. It is found that ifqueue priorities are added in the scheduling intelligently thenbetter performance could be obtained. Data model helpschoosing appropriate preferences.

【 授权许可】

Unknown