New answers tagged

-1 votes

Is Starvation possible in First Come first serve CPU scheduling algorithm

OS would generally trap these type of process and core would be dumped.
BRATIN MONDAL's user avatar
0 votes

Tigers and elephants can't drink water from a pond simultaneously, while more than one tiger or more than one elephants can drink water simultaneously

Starvation Free Solution assuming FIFO Waiting Queue ...
BRATIN MONDAL's user avatar
0 votes

Confusion in the solution to first readers-writers synchronization

Essentially in your example: The correct sequence of description would be - Reader 1 arrives Reader 1 starts reading Writer 1 arrives and starts waiting Reader 1 completes Writer 1 starts writing ...
BRATIN MONDAL's user avatar
0 votes

How to test progress and bounded waiting in Peterson's algorithm?

We note that a process P i can be prevented from entering the critical section only if it is stuck in the while loop with the condition flag[j] == true and turn == j ; this loop is the only one ...
BRATIN MONDAL's user avatar
0 votes

Bankers Algorithm - maximum number of processes

Yes. It should be 4 only. $4\times n+1 \leqslant 20 $ Maximum possible value of n is 4
BRATIN MONDAL's user avatar
1 vote

Process Synchronization: Dekker's algorithm

Yes, it ensures bounded waiting. In the example you have given even if p0 enters twice in a row, p1 will be able to enter in it the after p0's second entry. Normally you will see only 1 entry to the ...
BRATIN MONDAL's user avatar
1 vote

Deadlock in LockTwo Algorithm

I've recently been reasoning about this algorithm as well. I think its both. You pointed out the starvation case. Here is the author's definition of deadlock as given on page 24: Freedom from ...
aCrookedCowboy's user avatar

Top 50 recent answers are included