Refine your search
Collections
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Jain, Saurabh
- Probability-Based Analysis to Determine the Performance of Multilevel Feedback Queue Scheduling
Abstract Views :154 |
PDF Views:1
Authors
Shweta Jain
1,
Saurabh Jain
2
Affiliations
1 Pacific Academy of Higher Education and Research University, Udaipur, IN
2 Shri Vaishnav Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, IN
1 Pacific Academy of Higher Education and Research University, Udaipur, IN
2 Shri Vaishnav Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, IN
Source
International Journal of Advanced Networking and Applications, Vol 8, No 3 (2016), Pagination: 3044-3069Abstract
Operating System may work on different types of CPU scheduling algorithms with different mechanism and concepts. The Multilevel Feedback Queue (MLFQ) Scheduling manages a variety of processes among various queues in a better and efficient manner. CPU scheduler appears transition mechanism over various queues. This paper is presented with various schemes of under a probability-based model. The scheduler has random movement over queues with given time quantum. This paper designs general transition model for its functioning and justifying comparison under different scheduling schemes through a simulation study applied on different data sets in particular cases.Keywords
Markov Chain Model, Multi-Level Feedback Queue Scheduling, Process Queue, Process Scheduling, Transition Probability Matrix.- Analysis of Multi Level Feedback Queue Scheduling Using Markov Chain Model with Data Model Approach
Abstract Views :151 |
PDF Views:4
Authors
Shweta Jain
1,
Saurabh Jain
2
Affiliations
1 Department of Computer Applications, Shri R.G.P. Gujarati Professional Institute, Indore-10, IN
2 Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, IN
1 Department of Computer Applications, Shri R.G.P. Gujarati Professional Institute, Indore-10, IN
2 Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, IN
Source
International Journal of Advanced Networking and Applications, Vol 7, No 6 (2016), Pagination: 2915-2924Abstract
When a process gets the CPU, the scheduler has no idea of the precise amount of CPU time the process will need. Process scheduling algorithms are used for better utilization of CPU. The number of processes arriving to the CPU at a time comes in mass volume which causes a long waiting queue. In Multilevel feedback queue scheduling, the scheduler moves from one queue to another in order to perform the processing follow the transition mechanism. This paper analysed a general transition scenario for the functioning of CPU scheduler in multilevel queue with feedback mechanism. We proposed a Markov chain model to analyze this transition phenomenon with a general class of scheduling scheme. Simulation study is performed to evaluate the comparative study with the help of varying values of α and d in a mathematical model.Keywords
Markov Chain Model, Multi-Level Feedback Queue Scheduling, Process Queue, Transition Probability Matrix, Wait State.- Effect of Data Model Approach in State Probability Analysis of Multi-Level Queue Scheduling
Abstract Views :132 |
PDF Views:0
Authors
Affiliations
1 Department of Mathematics and Statistics, Sagar University, Sagar-470003, M.P., IN
2 Department of Computer Science & Applications, Sagar University, Sagar-470003, M.P., IN
1 Department of Mathematics and Statistics, Sagar University, Sagar-470003, M.P., IN
2 Department of Computer Science & Applications, Sagar University, Sagar-470003, M.P., IN
Source
International Journal of Advanced Networking and Applications, Vol 2, No 1 (2010), Pagination: 419-427Abstract
In the uniprocessor environment, the number of jobs arriving at the processor of CPU at a time is very large which causes a long waiting queue. When conflict arises due to shared resources or overlap of instructions or logical error, the deadlock state appears where further processing of jobs is blocked completely. While the scheduler jumps from one job to another in order to perform the processing the transition mechanism appears. This paper presents a general structure of transition scenario for the functioning of CPU scheduler in the presence of deadlock condition in setup of multilevel queue scheduling. 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 and well known schemes are treated as its particular cases and are compared under the setup of model through a proposed deadlock-waiting index measure. Simulation study is performed to evaluate the comparative merits of specific schemes belonging to the class designed with the help of varying values of α and d.Keywords
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.- A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme
Abstract Views :222 |
PDF Views:0
Authors
Affiliations
1 Dept. of Mathematics and Statistics, Dr. H.S. Gour University, Sagar-470003 (M.P.), IN
2 Dept. of Comp. and Applications, Dr. H.S. Gour University, Sagar-470003 (M.P.), IN
3 Indira Gandhi Engineering College, Sagar, IN
1 Dept. of Mathematics and Statistics, Dr. H.S. Gour University, Sagar-470003 (M.P.), IN
2 Dept. of Comp. and Applications, Dr. H.S. Gour University, Sagar-470003 (M.P.), IN
3 Indira Gandhi Engineering College, Sagar, IN