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

Determine the odd parity bit for f, Q. Determine the odd parity bit for F. ...

Q. Determine the odd parity bit for F. Q. Convert the following from binary to decimal, hexadecimal, BCD and octal. a) 1000000011   b) 0001010110101  c) 1 Q. Convert the f

Derive the expression of traffic capacity, Traffic Capacity is given by? ...

Traffic Capacity is given by? Traffic Capacity = Switching capacity × Theoretical maximum load.

Describe the von neumann architecture, Describe the VON NEUMANN ARCHITECTUR...

Describe the VON NEUMANN ARCHITECTURE Most  of  present  computer  designs  are  based  on  idea  developed  by  John  vonNeumann referred to as the VON NEUMANN ARCHITECTURE. V

Tag do you use to add a hyperlink column to the DataGrid, What tag do you u...

What tag do you use to add a hyperlink column to the DataGrid?   Anchor tag is used to add a hyperlink column to the data grid

Constructor, what is meant by private copy constructor

what is meant by private copy constructor

What is partition, What is partition? Partitions divide a system into s...

What is partition? Partitions divide a system into several independent or weakly coupled subsystems, each giving one kind of service. Partitions use peer-peer subsystems.

Exception handling and recursion, In the previous assignment, you implement...

In the previous assignment, you implemented a stack and a list that both inherited from the abstract class ArrayIntCollection. In this task you are supposed to extend that implemen

Combinational logic, At a particular moment in time the output of a COMBINA...

At a particular moment in time the output of a COMBINATIONAL logic circuit depends uponthe inputs to the circuit at the same instant.(Unlike sequential logic circuits where the out

Karnaugh maps, Minimisation using Boolean algebra is not always straight fo...

Minimisation using Boolean algebra is not always straight forward and sometimes it is not obvious if a further manipulation would give a simpler circuit. Karnaugh maps are a muc

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