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

Difference between overlay graph and correlate graph, Overlay Graph: It ove...

Overlay Graph: It overlay the content of two graphs that shares an ordinary x-axis. Left Y-axis on the merged graph show's the present graph's value & Right Y-axis illustrate the v

Structure tensor, what is structure tensor?how we calculate for image pixel...

what is structure tensor?how we calculate for image pixel?

Explain potential of parallelism, Potential of Parallelism Problems in ...

Potential of Parallelism Problems in the actual world differ in respect of the amount of inherent parallelism intrinsic in respective problem domain. Some problems can be easil

Finite automata, applications of context free grammar

applications of context free grammar

Explain call by value and call by reference, Call by value and Call by refe...

Call by value and Call by reference Call by value means sending the values of the arguments- The value of each of the original arguments in the calling function is copied in

standard console application, Three projects as follows: a. Life  stati...

Three projects as follows: a. Life  static library, code for every needed  function in the Life program. b. LifeGame  .exe application, i.e., a standard console application t

Illustrate the working of flip-flops, Q. Illustrate the working of FLIP-FLO...

Q. Illustrate the working of FLIP-FLOPS? A flip-flop is a binary cell that stores 1-bit of information. It itself is a sequential circuit. We know that flip-flop can change its

Prove the equations using the boolean algebraic theorems, Prove the equatio...

Prove the equations A + A‾ .B + A.B‾ = A + B using the Boolean algebraic theorems ? Ans. The equation is A + A‾.B + A.B‾ = A + B L.H.S. = A + A‾ .B + A.B‾ = (A + A.B‾) + A‾.B

C++.., how to swap to nunbers

how to swap to nunbers

Explain the importance of search engines, Explain the importance of Search ...

Explain the importance of Search Engines The most effective way of finding information on the internet is to use a search engine. Though, it's just as easy to use these ineffic

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