Explain policies for process scheduling, Computer Engineering

Assignment Help:

Explain any three policies for process scheduling that uses resource consumption information.

All three policies for process scheduling are explained below in brief:

1. First-come First-served (FCFS) (FIFO)

- Jobs are scheduled in order of coming

- Nonpreemptive

Problem:

- Average waiting time can be huge if small jobs wait behind long ones

- May cause poor overlap of I/O and CPU and convoy consequences

2. Shortest Job First (SJF)

- Select the job with the shortest next CPU burst

-For minimizing average waiting time provably optimal

Problem:

- Not possible knowing the length of the next CPU burst

3. Round Robin (RR)

- Frequently used for timesharing

- Ready queue is function as a circular queue (FIFO)

- Each process is specified a time slice termed as a quantum

- This is run for the quantum or till it blocks

- RR allocates the CPU uniformly or fairly across each participant. If average queue length is n, all participants get 1/n

- Since the time quantum grows, RR becomes FCFS

- Smaller quanta are usually desirable, since they improve response time

Problem:

- Context-switch over-head of frequent context-switch

Related Discussions:- Explain policies for process scheduling

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

Adding layers to the timeline, ADDING LAYERS TO THE TIMELINE AND GIVING MOT...

ADDING LAYERS TO THE TIMELINE AND GIVING MOTION TO THE LAYER Step 1: Choose Layer from Common toolbar after that draw a layer. Step 2: Write the text inside Layer. Step

What are threaded binary trees, What are threaded binary trees? A Threa...

What are threaded binary trees? A Threaded Binary Tree is a binary tree in which each node that does not have a right child has a THREAD (in real sense, a link) to its INORDER

Convert ascii code to its bcd equivalent, Convert ASCII code to its BCD equ...

Convert ASCII code to its BCD equivalent. This can be achieved by simply replacing bits in upper four bits of byte by four zeros. For illustration the ASCII '1' is 32h = 0010B. By

Describe about the database marketing application of olap, Database marketi...

Database marketing tool or application helps a user or marketing professional in determining the right tool or plan for his valuable add campaign. This tool haves data from all sou

Define about the objects, Define about the Objects The object notation...

Define about the Objects The object notation is the same in basic form as that for a class. There are three differences among the notations, these are given below: With

What is the linkage section, The linkage section is part of a known as prog...

The linkage section is part of a known as program that 'links' or maps to data items in the calling program are working storage. It is the part of the called program where these sh

Determine the define byte - assembler directives, Determine the Define Byte...

Determine the Define Byte - Assembler directives DB (Define Byte): DB directive defines a byte-type variable (i.e. a variable that occupies one byte of memory space). In a give

What is a shift register, What is a Shift Register? Ans: Shift R...

What is a Shift Register? Ans: Shift Register: A register wherein data finds shifted towards left or right while clock pulses are applied is termed as a Shift Register.

Identify state as shifting register content to left by 1 bit, Shifting a re...

Shifting a register content to left by one bit position is equivalent to ? Ans. Multiplication by two is equivalent while shifting register content to left by one bit position.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages