Hi,
This is mainly related to O/S . And we have no specific thread for it, I am posting over here as I have no other choice.

Well it says "a critical problem must satisfy three conditions."

a. mutual exclusion
b. progress
c. bounded-waiting


I understood 'a' and 'b', but couldn't understand bounded-waiting, what it really means ?

They say like this

A bound must exist on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted


what really does it mean ?? can anyone explain it a bit more

You understand that a critical section is a protected block of (usually) shared code in memory that you set up.

This block can have only one process running that code. Process B want to run the code. It requests it. Meanwhile process A just keeps running the code over and over. If process A can go on as long as it wants, then process B is stuck waiting almost forever. So, if we can count the number of time A hits the section, and then say after A hits the section 100 times: 'Okay A, you've had enough turns... process B, the section is now yours'.

It is part of scheduling, very like the idea of a quantum (time slice) of the CPU. You get your turn, and when somebody else wants a turn and your time is up, the other guy gets his turn.

1 members found this post helpful.

oh in that case, some process is not allowed to use some resource for infinite amount of time once it gets it...am i correct ?