Scribd Logo
Upload

Welcome to Scribd!

  • Exercise 6

    Uploaded by

    Lida Lieda
    6 views2 pages
    Dekker developed the first correct solution to the critical-section problem for two processes sharing variables. The processes P0 and P1 share Boolean flags initially set to false and an integer turn variable. The structure of each process Pi is shown in a figure and requires proving the algorithm satisfies the three requirements of the critical-section problem.

    Original Description:

    Original Title

    Exercise 6.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Dekker developed the first correct solution to the critical-section problem for two processes sharing variables. The processes P0 and P1 share Boolean flags initially set to false and an integer turn variable. The structure of each process Pi is shown in a figure and requires proving the algorithm satisfies the three requirements of the critical-section problem.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    Exercise 6

    Uploaded by

    Lida Lieda
    Dekker developed the first correct solution to the critical-section problem for two processes sharing variables. The processes P0 and P1 share Boolean flags initially set to false and an integer turn variable. The structure of each process Pi is shown in a figure and requires proving the algorithm satisfies the three requirements of the critical-section problem.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Exercise 6.

    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.21. The other process is Pj ( j == 1 or 0).
    Prove that the algorithm satisfies all three requirements for the critical-section problem.
    Exercise

    You might also like