Process execution priorities, Operating System

Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the processor cycles for use on lower priority queues; some others implement priority aging whereby the priority of a process increases the longer it has been waiting. Discuss the relative advantages and disadvantages of these schedulers versus a preemptive priority scheduler where priorities are fixed, and the analysis of response time of a process need only consider processes at the same and higher priorities (assuming priority inversion is ignored), and where also a process can guarantee that no higher priority process can be pending when this process is executing (i.e. higher priority process execution is atomic with respect to this process.).

Posted Date: 2/22/2013 1:39:54 AM | Location : United States







Related Discussions:- Process execution priorities, Assignment Help, Ask Question on Process execution priorities, Get Answer, Expert's Help, Process execution priorities Discussions

Write discussion on Process execution priorities
Your posts are moderated
Related Questions
Write a brief note on demand paging. A demand paging is alike to a paging system with swapping. The Processes reside on the secondary memory while we want to implement a proces

Define the “turn-around” time of a user job Turn- around time is total time taken to execute the job.

what is deadlock

What is a sequential file? A file that is read one record or block or parameter at a time in order, based on a tape model of a file.

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

Q. The accelerating search for described in subsequent exercise is typical of hard-disk drives. By contrast floppy disks and several hard disks manufactured before the mid-1980s t


i need the job to be done within 3days

Deadlocks can be detected while the program is running, by running cycle detection algorithms on the graph that de?nes the current use of resources. De?ne this graph as follows:

Q. How Program execute in operating system? Program execution: Operating system loads a program in memory and executes the program. The program should be able to end its exec