priority-based scheduling algorithm , Operating System

Your task is to replace the round robin CPU scheduling scheme you developed in Practical 6 with a priority-based scheduling algorithm. To simplify matters, you can maintain the original linked list, but must now calculate a value for the priority field in the pcb structure (within insert_ready()), and modify dispatch() to take this value into account when selecting the next process to run.

When calculating a priority value, some possible inputs are:

1. the age of the process;

2. the amount of time a process has been waiting since its last cpu burst;

3. the total accumulated cpu time for the process;

4. anything else in the PCB;

5. the system time.

 

 

Posted Date: 2/26/2013 2:02:13 AM | Location : United States







Related Discussions:- priority-based scheduling algorithm , Assignment Help, Ask Question on priority-based scheduling algorithm , Get Answer, Expert's Help, priority-based scheduling algorithm Discussions

Write discussion on priority-based scheduling algorithm
Your posts are moderated
Related Questions
Most process abstractions support processes being destroyed when the program terminates, or in response to a specific kill directive. There are two common implementations, one a "p

Discuss in detail Table management Techniques?     An Assembler employs the subsequent tables: OPTAB: Operation Code Table consists of mnemonic operation code and its machi

What is the main advantage of the layered approach to system design? As in all cases of modular design, designing an operating system in a modular way has several benefits. Th

WHAT ARE THE ADVANTAGES AND DISADVANTAGES OF DUAL MODE OPERATION OF OPERATING SYSTEM>?

what is an operating system?

Deadlock Prevention Prevention is the name given to method that guarantee that deadlocks can never happen for the reason that the way the system is structured. Since 4 conditio

How does a program execution take place in multiprogramming? While the processor is dealing with a number of programs, the sequence with which programs are implemented will de


Discuss the concepts of  task decomposition  and  data decomposition  within the context of parallel programming. Parallel programming or parrelel computing is the simultaneo

Explain about deadlock prevention? In order for the occurrence of deadlock, the four conditions like mutual exclusion, hold and wait, no pre-emption and  circular wait must hap