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?

Cryptography, #questionConsider the one-time pad encryption scheme to encry...

#questionConsider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the event

Cai, What is CAI? Explain its pitfalls.

What is CAI? Explain its pitfalls.

Compare between file processing system and dbms, Problem a. Compare bet...

Problem a. Compare between file processing system and DBMS >>This is a comparison of DBMS with file processing system which the answer has to be searched from the GOOGLE an

Application-specific multiprocessors, Application-Specific Multiprocessors ...

Application-Specific Multiprocessors Although this book details a variety of similar architectures, it specializes in the design of such architectures in the perspective of par

Login, Login Because the information on a network is sharable, network...

Login Because the information on a network is sharable, networks are very susceptible to unauthorized intruders. In order to prevent unauthorized access to use the services o

Quantitative Methods in Business Decision Making, 4. Union City Al has dec...

4. Union City Al has decided to upgrade their tornado warning system. The city leaders have identified six potential locations for erecting a warning siren tower. They want to e

Assigment, how to measure marginal utility.?

how to measure marginal utility.?

Base, 123 is not valid in which base value

123 is not valid in which base value

Define opportunity cost, Define opportunity cost The opportunity cost...

Define opportunity cost The opportunity cost of any commodity is defined as the cost of next best alternative, which has been sacrificed for producing the given commodity. Th

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