ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > CLASS (2016-2017-1)-62903-06102-1 > >
hw6.1 Version 0
👤 Author: by sjd20057 2016-12-26 19:55:04
Hw6.1

this algorithm satisfies three conditions.

If both processes set their flag to true, only one will succeed.

If a process wishes to access their critical section, it can set their flag variable to true and enter their critical section.

Bounded waiting is preserved through the use of the TTturn variable.

Please login to reply. Login

Reversion History

Loading...
No reversions found.