Logo
ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > CLASS (2016-2017-1)-62903-06102-1 > celeste 2014529627003 >
homework 3 Version 0
👤 Author: by 1529034972qqcom 2017-01-04 13:57:11
6.1 The first known correct software solution to the critical

 

-section problem for two processes was developed by Dekker. The two processes, P0 and P1 , share the following variables:

 

boolean flag[2]; /* initially false */

 

int turn;

 

The structure of process Pi (i == 0 or 1) is shown in Figure 6.25; the other process is Pj ( j == 1 or 0). Prove that the algorithm satisfies all three requirements for the critical-section problem.

Please login to reply. Login

Reversion History

Loading...
No reversions found.