Explain the features of major scheduling algorithms, Computer Engineering

Assignment Help:

Explain the Features of Major scheduling algorithms.

The Features of Major scheduling algorithms is given below:

  1. FCFS - i.e. First come first served scheduling
  2. Shortest Job First scheduling (SJF)
  3. Priority scheduling
  4. Round robin scheduling

First come first served scheduling-

  • Process which request the CPU first is assigned CPU first
  • Managed through FIFO queue.
  • Average waiting time is usually long
  • Non-pre-emptive
  • For time-sharing systems, troublesome

Shortest job first (SJF)

  • The process that has the smallest CPU burst time gets first
  • This increases the waiting time of long processes.
  • Problem - difficult to predict the length of subsequent CPU request
  • May be non-pre-emptive or be preemptive

Priority

  • Highest priority process finds CPU allocation first
  • The larger the CPU burst then lowers the priority
  • Priority can be explained internally or externally
  • Can be non-pre-emptive or preemptive
  • Problem-starvation i.e. blocking of process
  • Solution-aging - raises the priority

Round robin

  • Time quantum from 10 100 millisecond is described
  • Processes are seem in circular queue
  • CPU allocation is divided between processes accordingly
  • Performance depends heavily upon time quantum
  • Pre-emptive

Related Discussions:- Explain the features of major scheduling algorithms

Capacity and performance of storage - computer architecture, Capacity: ...

Capacity: Raw capacity Total amount of stored information that a medium or storage device can hold is expressed as a quantity of bytes and bits (for example 10.4 megabyte

Eequivalences rules, Eequivalences rules: This conveys a meaning that ...

Eequivalences rules: This conveys a meaning that is actually much simpler so than you would think on first inspection.  Hence we can justify this, by using the following ch

Define memory read and write operation, Define Memory read and write operat...

Define Memory read and write operation The transfer of information from a memory word to outside environment is known as read operation. The transfer of new information to be k

Synchronous sequential circuits, Q. Differentiate the Multiplexer and Demul...

Q. Differentiate the Multiplexer and Demultiplexer with respect to their concept, block diagram and circuit. Q. What is the difference between Synchronous sequential circuits an

Where the grade of service is measured, The grade of service is measured in...

The grade of service is measured in (A) Percentage                                  (B)  Number (C)  Fractional Number                    (D)  Logarithmic Number  Ans

What do you mean by software poll, Q. What do you mean by Software Poll? ...

Q. What do you mean by Software Poll? In this scheme on occurrence of an interrupt, processor jumps to an interrupt service program or routine whose job is to poll (roll call

System programming, concurrentisation and vectorisation of program

concurrentisation and vectorisation of program

Describe about relationships and look up fields, Relationships are imported...

Relationships are imported from the source to finish without any hindrance but once they land in the destination they can never be changed or changed and change of extensions canno

Simplify the expression by using karnaugh map, Simplify   the   following  ...

Simplify   the   following   expression   into   sum   of   products   using   Karnaugh   map F(A, B, C, D) = ∑ (1,3,4,5,6,7,9,12,13) Ans. Simplification of the giv

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