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

explain in detail about ipc in linux

What is an effector process? The effector process is a method that verifies itself.The effector process exists in particular criteria.

Problem: Within a corporate environment, there are usually many servers located across various departments. Naming of servers is often a tedious task. In many circumstances, w

Tree structured directories: This is the main common directory structure. The tree has a root directory as well as every file in the system has a unique path name. A directory

What is a Process Control Block? Every process in the operating system is represented by a process control block as well called a task control block. It contains several pieces

Q. Why page sizes always powers of 2? Answer: Recall that paging is executed by breaking up an address into a page and offset number. It is most competent to break the address

Buddy system of memory allocation Free memory is used to maintain in linked lists, each of similar sized blocks. Every block is of size 2^k. When some memory is needed by a th


How free-space is managed using bit vector implementation? The free-space list is implemented as a bit map or bit vector. Each block is shown by 1 bit. If the block is free, th