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 by which digits are represented in dtmf phone, In a DTMF phone, d...

In a DTMF phone, digits are represented by: (A)  Orthogonal frequencies. (B)  Orthogonal Phases. (C)  Orthogonal codes. (D)  Orthogonal pulses. Ans: Di

Memory-to-memory architecture:, Memory-to-Memory Architecture : The pipe...

Memory-to-Memory Architecture : The pipelines can access vector operands, intermediate and final results directly in the main memory. This needs the higher memory bandwidth. How

What do you understand by scan codes, Q. What do you understand by Scan Cod...

Q. What do you understand by Scan Codes? A scan code is a code produced by a microprocessor in keyboard when a key is pressed and is unique to key struck. When this code is rec

..binary tree, draw a binary tree from its inorder and preorder traversal s...

draw a binary tree from its inorder and preorder traversal sequences given as follows: inorder: d b g e h a c n f preorder: a b d e g h c f n

Explain priority interrupt, What is priority interrupt? A priority inte...

What is priority interrupt? A priority interrupt is an interrupt that establishes a priority over the various sources to verify which condition is to be serviced first when two

Explain about double error detection bit, Q. Explain about Double Error Det...

Q. Explain about Double Error Detection bit? Let's presume now that two bit errors take place in data. Data received: So on -matching we conclude P3-D3 pair doesn't

Determine about the verilog task, Determine about the Verilog Task - Ta...

Determine about the Verilog Task - Tasks are capable of enabling a function as well as enabling other versions of a Task. - Tasks also run with a zero simulation however the

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