Can someone explain to me what Starvation free means compared to deadlocks?
I need to modify this deadlock answer so that is starvation free....
A mutex semaphore is all that will be needed to solve this problem. When a driver comes to the bridge they will reserve or request the semaphore. If they get the semaphore request, they will cross the bridge; once they have crossed the bridge they will give away or release the semaphore. If they don't give it away, they will wait until they have received the semaphore.
how can this be modified to starvation free?