Peterson vs Dekker Process 0 Peterson void P Slides: 10 Download presentation Peterson vs Dekker Process 0 - Peterson void P 0(){ while(TRUE){. . . flag[0] = TRUE; turn = 1; while (flag[1] == TRUE && turn == 1) do_nothing(); <Κρίσιμη Περιοχή> flag[0] = FALSE; . . . } } 9/14/2021 Process 0 - Dekker void P 0(){ while(TRUE){. . . flag[0] = TRUE; while (flag[1] == TRUE){ if (turn==1){ flag[0] = FALSE; while (turn==1) do_nothing(); flag[0] = TRUE; } } <Κρίσιμη Περιοχή> turn = 1; flag[0] = FALSE; . . . } } Αμοιβαίος Αποκλεισμός και Λάθη 4 Sensory memortVoid setup(void)Void main(void)Void main(void)Dekker's algorithm for n processesLucie douwes dekkerBristoetsGerben dekkerMutual exclusion adalahCác trạng thái của tiến trìnhElly dekker vng