Describe Priority Scheduling algorithm of operating system?, Basic Computer Science

Assignment Help:
Priority Scheduling

• The fundamental idea is straightforward: each process is assigned a priority, and priority is permitted to run. Equal-Priority processes are scheduled in FCFS order. The shortest-Job-First (SJF) algorithm is a special case of general priority scheduling algorithm.
• Priority can be defined either internally or outwardly. Internally distinct priorities use some measurable quantities or behaviors to compute priority of a process.
• An SJF algorithm is simply a priority algorithm where the priority is the inverse of the (predicted) next CPU burst. That is, the longer the CPU explodes, the lower the priority and vice versa.
Illustrations of Internal priorities are
• Deadlines.
• Memory necessities.
• CPU Vs I/O necessities.
• File necessities,
for example, number of open files.
Externally distinct priorities are set by criteria that are external to operating system for example:
• The significance of process.
• Kind or amount of funds being rewarded for computer use.
• The division sponsoring the work.
• A preemptive priority algorithm will preemptive the CPU if the priority of the newly arrival process is higher than the priority of the currently running process.
• This scheduling can be either preemptive or non preemptive
• A non-preemptive priority algorithm will simply put the new process at the head of the ready queue.
A major trouble with priority scheduling is indefinite blocking or starvation. A solution to the trouble of indefinite blockage of the low-priority process is aging. Aging is a method of gradually increasing the priority of processes that wait in the system for an extended period of time.

Related Discussions:- Describe Priority Scheduling algorithm of operating system?

Digital wireless telephone networks, Mobile telephone networks started with...

Mobile telephone networks started with analog technology. Analog cellular networks were known as first generation (1G) networks. Such networks had limited capacity, and were subjec

Cai, What is CAI? Explain its pitfalls.

What is CAI? Explain its pitfalls.

Algorithmic, define it #Minimum 100 words accepted#

define it #Minimum 100 words accepted#

How is python Using Blank Lines and Waiting for the User, A line holds onl...

A line holds only whitespace, probably with a comment, is identified as a blank line, and Python completely avoids it. In an interrelated interpreter session, you need to enter an

Twisted pairs, Twisted Pairs: Twisted pairs are familiar to all of us ...

Twisted Pairs: Twisted pairs are familiar to all of us as the copper wire telephone lines. These are of low frequency, and support a limited bandwidth (one voice channel) but

Multithread 1:1 Model, Given an operating system that supports a one – to ...

Given an operating system that supports a one – to –one relationship between user-level threads and kernel – level threads and allows one or more threads from a process to issue b

Advantages of computerized record-keeping, Advantages of Computerized Reco...

Advantages of Computerized Record-keeping Less manpower is required for upkeep.  Recording, storing, and retrieving are all much faster: easier and with little practice

COMPUTER ORGANIZATION, Ask questio2. Define interrupt n #Minimum 100 words ...

Ask questio2. Define interrupt n #Minimum 100 words accepted#

Identify the critical races, 1. The standard way for debuggers to plant bre...

1. The standard way for debuggers to plant breakpoints in a program in RAM (whatever the processor instruction set) is to save the breakpointed instruction and replace it by a jump

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd