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?

What is Shortest-Remaining-Time (SRT) Scheduling?, • The SRT is the preemp...

• The SRT is the preemptive complement of SJF and helpful in time-sharing environment. • In SRT scheduling, the process with the least estimated run-time to completion is run next,

Briefly explain formatting tool bar, Question 1 Briefly explain the classi...

Question 1 Briefly explain the classification of the computers Question 2 What is arithmetic logic unit? How it is helpful in CPU Question 3 How do you install a new pri

Computer architecture, Write control sequence for adding the content of the...

Write control sequence for adding the content of the memory location whose address is at memory location pointed by immediate number NUM to register R1. Assume the number NUM is pr

Python Identifiers, A Python identifier is a name used for classify a funct...

A Python identifier is a name used for classify a function, variable, class, module or any other object. An identifier begins with a letter A to Z or a to z or an underscore (_) fo

Explain any five different types of computers, Question 1 Explain any five...

Question 1 Explain any five different types of computers Question 2 Describe Bus Type LAN. Its disadvantages and advantages and examples Question 3 Describe the

Random reading and writing and Closing a fcb file, The 21H function and the...

The 21H function and the 22H function of the 21H interruption are the ones in charge of realizing the random readings and writings in that order. The random register number and the

Algorithm implementation, Implementing the -Crochemore-Perrin algorithm Th...

Implementing the -Crochemore-Perrin algorithm The software must be functional, code must be clear and including comments and it must have a nice and decent user interface

Assigment, how to measure marginal utility.?

how to measure marginal utility.?

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