Register

operating system

• edited by
366 views
0 votes
0 votes

The above solution is STARVATION-FREE right ??? Because both the processes will eventually get into the Critical-section and there is no indefinite waiting time for any process ....AM I CORRECT ? PLEASE CORRECT ME IF I AM WRONG ...

EDIT IN QUESTION : in P1's code, 2nd while will have semi-colon...(i.e) while(turn!=1); not while(turn!=1)

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
jaydip74 asked Jan 28
283 views
Operating System
How much time is required to load a 64 KB program from a disk with an average seek time of 30 ms, a rotation time of 20 ms per rotation, a track size of 32 KB, and a page size of 2 KB. It is assumed that the pages are spread randomly around the disk. A. 1200 ms B. 1300 ms C. 1320 ms D. 1400 ms
How much time is required to load a 64 KB program from a disk with an average seek time of 30 ms, a rotation time of 20 ms per rotation, a track size of 32 KB, and a page...
User Avatar
0 votes
0 votes
3 answers
3
Mrityudoot asked Jan 24
300 views
Operating System Round Robin
Does Round Robin guarantee bounded waiting?
Does Round Robin guarantee bounded waiting?
User Avatar
Link Copied!