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
What are the different thread levels? There are two broad type of thread implementation: User-Level Threads -- Thread Libraries. Kernel-level Threads -- System Calls.


What is an acyclic graph? A tree that has been corrupted by links to other branches, but does not have any cyclic paths in it.

Q. How does NTFS handle data structures? How does NTFS recover from a system crash? What is guaranteed after a recovery takes place? Answer: In NTFS all file-system data stru

Q. Illustrate Scope of Consumer behaviour ? Scope of consumer behaviour is extremely wide due to following reasons: >>Ever rising intensifying competition. >>Additional a

Conservative GC can be used for languages such as C and C++, which were not explicitly designed for garbage collection. This is a non-copying technique. A conservative garbage coll

What are the different ways in which a thread can be cancelled? Cancellation of a target thread may happen in two different scenarios: Asynchronous cancellation: One thr

Making the Transition to Client - Server Programming Making the transition to client - server programming is a significant effort. Client - server applications must be designed

Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo

Smith, who is a civil engineer, purchased a 30-hectare block of land in Australia in 1986 and used two hectares of it as a main residence. The part that was not main residence cost