Does Peterson's algorithm satisfy starvation?

Question

I\'ve been searching information on Peterson\'s algorithm but have come across references stating it does not satisfy starvation but only deadlock. Is this true? and if so c

Answer 1

I suspect the comment about starvation is about some generalized, N-process Peterson's Algorithm. It is possible to construct an N-process version with bounded waiting, but without having one in particular to discuss we can't say why that particular generalization might be subject to starvation.

A quick Google turned up this paper which includes pseudocode. As you can see, the generalized version is much more complex (and expensive).