Recently i’m reading the book Operating System Concepts Chapter VI about critical section problem, in section 6.2, we know that an algorithm for solving synchronization problem must meet three requirements: 1. Mutual Exclusion 2.Progress 3.Bounded Waiting.
Obviously, if an algorithm meets second requirement (Progress), it doesn’t necessarily imply that this algorithm meet Bounded Waiting one because of the process speed or scheduling issue.
However, my question is that, if an algorithm meet Bounded Waiting requirement, can we imply from this that, this algorithm also meet Progress requirement?
If no, what’s the condition?
If yes, why don’t we raise ONLY the third requirement and delete the second one since the third one can imply second one.
BTW, can any one explain the relationship (and differences) between second one and third one?
Concepts of Progress and bounded waiting are totally different.
Bounded waiting means a process can eventually get the lock/mutex whatever. While progress condition means the process can complete its execution. There is a circumstance called live-lock(corresponding to deadlock), in which two or more processes are organized as a process group, all the processes can acquire or release lock, which satisfy Bounded waiting, but the process group cannot progress(or why we call it live-lock. :-)).
Good luck and Regards