1 / 2

19b

Readers (R1 and R2) execute: [1] wait (CountGuard-sem) [2] ar = ar+1 [3] if aw=0 then rr = rr+1; must_wait = false [4] else must_wait = true [5] signal (CountGuard-sem) [6] if must_wait then wait (R-sem). Classical shared memory concurrency control. 19b.

marsden-george
Download Presentation

19b

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Readers (R1 and R2) execute: [1] wait (CountGuard-sem) [2] ar = ar+1 [3] if aw=0 then rr = rr+1; must_wait = false [4] else must_wait = true [5] signal (CountGuard-sem) [6] if must_wait then wait (R-sem) Classical shared memory concurrency control 19b

  2. Readers (R1 and R2) execute: [1] wait (CountGuard-sem) [2] ar = ar+1 [3] if aw=0 then rr = rr+1; must_wait = false [4] else must_wait = true [5] signal (CountGuard-sem) [6] if must_wait then wait (R-sem) Classical shared memory concurrency control 19c

More Related