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, Consider the one-time pad encryption scheme to encrypt a 1-bi...

Consider 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 "message

What is an array? explain, Question 1 . What is an array? Explain Qu...

Question 1 . What is an array? Explain Question 2 . What do you mean by optional arguments? Describe Question 3 . Describe in brief about interfaces Question 4

Elements of programming language, ELEMENTS OF PROGRAMMING LANGUAGE:  L...

ELEMENTS OF PROGRAMMING LANGUAGE:  Learning a programming language requires understanding of concepts such as representation of different types of data in the computer, the va

Write the steps for applying animations, Question Write the steps for a...

Question Write the steps for applying animations. Prepare a presentation of 5 slides in a creative for any topic in your semester (research methods/Business strategy/Financial

Programmable rom (prom) , PROGRAMMABLE ROM (PROM): The user can program...

PROGRAMMABLE ROM (PROM): The user can program a PROM after purchase.  Each memory bit element in the PROM contains a nichrome or silicon link that acts as a fuse.  The user can

Define procedure of Building Assembler programs, In order to be able to mak...

In order to be able to make a program, quite a lot of tools are needed: Earliest an editor is used to create the source program. Next a compiler, which is nothing more than a progr

Explain the term "algorithmic delay", QUESTION a) What is Time Division...

QUESTION a) What is Time Division Multiplexing (TDM), illustrate your answer with a diagram b) Describe four types of RTCP messages c) i) What is silence compression in I

C, board coloring

board coloring

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