1,280 views
1 1 vote
I read that one of the disadvantage of busy waiting solution to synchronization is that PRIORITY INVERSION can occur in it.

My doubt is, does the priority inversion problem only occur in busy waiting solution or it can occur in without busy waiting solution too. Please explain. Thanks.

1 Answer

Best answer
2 2 votes

yes you are talking abut non-busy waiting means of SEMAPHORE..yes problem of priority inversion occure here too...

say when you are using Binary semaphore ...now assume a process comes and do DOWN() on semaphore ....and enter into CS..but as same time a high priority process comes...

 if hight priority process leads low priority too preempt...then process inside CS will not do UP on semaphore and result is that no one can enter into CS....as logically low priority is still holding CS....hence priority inversion occure.....

but to cause PRIORITY INVERSION...PROCESS MUST BE PREEMPTED before executing UP() on mutex..

• selected by
Position:
Show:

Related questions

1 1 vote
1 1 answer
740
740 views
pC asked Dec 11, 2015
740 views
Peterson's SolutionSWAP instructionStrict AlternationBoth 2 and 3
4 4 votes
1 1 answer
275
275 views
GO Classes asked Jul 25
275 views
Which of the following statements are correct?Mutual exclusion ensures that if one process is executing in its critical section, no other process can execute in its criti...
2 2 votes
3 3 answers
337
337 views
0 0 votes
1 answers 1 answer
1.1k
1.1k views
kritika madaan asked Dec 21, 2024
1,138 views
what is the minimum and max value of count? My doubt is while executing in between the loop the thread T1 can preemt in between like say T1 executes loop 1 time and preem...