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

Explain about bus of register transfer, Explain about Bus of register trans...

Explain about Bus of register transfer Since a computer has   several registers, paths must be provided to transfer information among registors. If separate lines are used amon

Calculate traffic lost in a particular exchange, In a particular exchange d...

In a particular exchange during busy hour 1200 calls were offered to a group of trunks, during this time 6 calls were lost. The average call duration being 3 minutes Calculate Tr

Objectives of parallel computing, Objectives of Parallel Computing Aft...

Objectives of Parallel Computing After reading this topic, you would be able to: Tell historical details of parallel computing; Explain the fundamental ideas of dis

Draw a schematic for managing dynamic storage allocation, Draw a simple sch...

Draw a simple schematic for managing dynamic storage allocation. A simple schematic for managing dynamic storage allocation is as follows: Block size pointe

Illustrate simple ALU organisation, Q. Illustrate Simple ALU Organisation? ...

Q. Illustrate Simple ALU Organisation? An ALU comprises circuits which perform data processing micro-operations. Though how are these ALU circuits used in conjunction of other

Existential introduction, Existential Introduction: Now if we have any...

Existential Introduction: Now if we have any sentence as, A, and variable, v, that does not occur in A, so then for any ground term, g, such occurs in A, than we can turn A in

Explain the various interface circuits, Explain the various interface circu...

Explain the various interface circuits.  An I/O interface having of circuitry required to connect an I/O device to computer bus. One side having of a data path with its associa

Episodes - artificial intelligence , Episodes - artificial intelligence: ...

Episodes - artificial intelligence: If an agent's current choice of action not based on its past reactions, then the environment is known as episodic. In the non-episodic envi

What start bit and stop bit, What start bit and stop bit The first bit ...

What start bit and stop bit The first bit known as the Start bit is always a zero and it is used to show the beginning of the character The last bit is known as the stop bit

Hiring problem algorithm, Consider the Hire Assistant problem. We interview...

Consider the Hire Assistant problem. We interview n candidates and always hire the best qualified so far. Let n = 5 for our example. Find the probabilities that we hire exactly 1 t

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