The Gateway to Computer Science Excellence
0 votes

explanation please...???

and what is the difference between convoy effect and starvation?

in Operating System by Active (1.4k points) | 908 views

Convoy effect is slowing down of the whole operating system for some time because of few slow process But Starvation is the indefinite postponement of a process because it requires some resource before it can run, but the resource, though available for allocation, is never allocated to this process.

So we can say convoy effect is not related to starvation . 

Convoy effect for a system and starvation is for a particular process no relation between them.

I am thinking answer should be all of then..If not why so?

Any one justify the answer!

3 Answers

+10 votes
Best answer

convoy effect can occur in FCFS like suppose the first process which arrived in the queue has a huge burst for that time all other processes will have to wait...this is convoy effect like a minister is crossing the road and all other traffic has to wait for some time....but it will not be infinte...all processes will eventually get a chance..

starvation is dying with hunger....dying without even getting a chance to get processed...if starvation is severe it can even lead to a deadlock kind of situation...and this can happen in all algos except FCFS and Round in SJF as u r not depending on arrival matter at what time a process has arrived in the system u have to schedule the process with least burst time there is a chance that u scheduled one process P1 and before going to some other process say P2 which was just arrived after P1...some other process arrived with least burst time than P2..then u have to schedule that process...and what if it keeps on happening?...P2 will never be scheduled and gets starved....this is m assuming that any no of process can arrive in the system because we have to think about the worst case..

by Boss (19.8k points)
selected by
Nice explanation
+5 votes
What you are asking ?? their is no realtion B/w convoyes effecr and starvation .

Bdw First come first served and round robin never go into starvation ( always give change for every process to execute on cpu).

Sortest job get starved when every time new process come with small running time. same as with priority process evry process come with high priority then starvation posible but can be removed by priority inversion.

D s answer
by Veteran (63k points)
0 votes
answer : D


by Junior (977 points)

Convey Effect: FCFS

  • Round Robin avoid convey effect.

Starvation: SJF/SRTF, Priority Scheduling, Multilevel queue scheduling

  • Multilevel feedback queue scheduling algorithm avoid starvation.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,312 answers
105,033 users