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
Developing Code with Threads Writing code to support a thread-based implementation is very straightforward. Simple APIs are presented to the developer for each threads package.

why we say OS is a resource allocator and control program

Q. Suppose an operating system maps user-level threads to the kernel utilizing the many-to-many model where the mapping is done through the use of LWPs. In addition the system allo

Multi-user - A multi-user Operating System permits for multiple users to use the same computer at the same time and/or different times. Below are some instances of multi-user Op

Medium term scheduling is form of the swapping operation. This attaches to processes that are in a suspended or blocked state. They are swapped out of real-memory storage until t


Some CPUs provide for more than two modes of operation. What are two possible uses of these multiple modes?

The following information is available for three MPS (Master Product Scheduling) items: Product A                            An 80 unit order is to be started in Week 3.

File allocation using I nodes. This method is used to decrease the size of the table in the above method. Every file will have an I-node list. Allow a file have 15 pointers a

Define the Sleep (sec) Function Sleep function suspends execution of this process for sec number of seconds. While this function is used in our example for consistency, other f