Operating Systems (2INC0) 2017/18

Transcription

1 Operating Systems (2INC0) 2017/18 Condition Synchronization (07) Dr. Courtesy of Prof. Dr. Johan Lukkien System Architecture and Networking Group

2 Agenda Condition synchronization motivation condition variables monitors scheduling / signalling disciplines 2

3 Agenda Condition synchronization motivation condition variables monitors scheduling / signalling disciplines 3

4 Recall: Last lecture Cooperation à Synchronization N concurrent processes working for a common goal goal1: avoid program traces that may violate a certain invariant goal2: steer the execution to have some property e.g. such that a certain assertion holds at certain control points Typically, by blocking thread execution until an assertion becomes true. Competition à Mutual exclusion N concurrent processes competing for a resource repeatedly executing a critical section (CS) Introduce extra synchronization requirement: Multiple processes cannot be in their CS at the same time 4

5 Condition synchronization: motivation Action (or event) synchronization the invariant refers to ordering of actions: à counting actions is enough BUT: Just counting does not solve all synchronization problems e.g. modification that cannot easily be seen as counting x : = y+z e.g. conditions that contain disjunctions (OR operations) wait until x=0 y=0 Condition synchronization the invariant refers to a certain (combined) state needs explicit communication (signalling) between processes Communicating via shared variables is not good enough! 5

6 Condition synchronization: motivation Needed when just counting is not enough to solve a synchronization problem Simplifies sequences of semaphore operations P(a); P(a); P(b); P(m);... Two condition synchronization principles: At places where the truth of a condition is required: check and block At places where a condition may have become true: signal waiters 6

7 Agenda Condition synchronization motivation condition variables monitors scheduling / signalling disciplines 7

8 Condition variables (basic operations) var cv: Condition; (Boolean function B defined on cv) 4 basic operations on variable cv: Wait(..., cv) suspend execution of caller Signal(cv) free one process/thread suspended on Wait(cv) (void if there is none) Sigall(cv) free all processes suspended on Wait(cv) Empty(cv) there is no process suspended on Wait(cv) (boolean function, returns true or false) Many extra operations in specific implementations. 8

9 Example Maintain x 0 in a program with arbitrary assignments to x. var cv: Condition; m: Semaphore (initially 1) 2) Allow others to join waiting queue 3) Only one waiter at a time is allowed to: re-check & leave the loop [... [... 4) Beware! P(m); P(m); Sigall(cv) may be called while x<10 do before Wait(cv) à too early! V(m); { Beware... } Wait (cv); P(m); od; { x 10 } x := x-10; x := x+100; Sigall (cv); V(m); V(m); ] ] 1) Releases all proc blocked on Wait(cv) Make sure all processes on the left reach Wait(cv) and they all get a chance to proceed! So: V(m); Wait(cv); P(m) 9

10 Combine: condition variable & semaphore Need to combine V(m); Wait(cv) atomically: define Wait(m,cv): <V(m); Wait(cv)>; P(m) var cv: Condition; m: Semaphore (initially 1) [... [... P(m); P(m); while x<10 do x := x+100; Wait (m, cv); Sigall (cv); od; V(m); { x 10 }... x := x-10; ] V(m); ] 10

11 Program structure Structure program in condition critical regions check truth of condition for executing the critical section use a repetition rather than a (e.g. if) selection, to be safe take competition into account, e.g. more instances decide carefully which variables must be protected together usually, these occur together in at least one condition access to these variables only within critical sections reads in other parts are harmless, but unstable A typical region looks like: mutex lock while not condition do Wait od; critical section possible signals mutex unlock 11

12 Using condition variables Signalling and waiting must be in critical sections needs an associated exclusion mechanism (e.g. a semaphore) cv is sometimes extended with a timeout mechanism. recheck even though there is no signal. Each condition variable cv is associated with a condition B(cv) Signaling means B(cv) may have become true. B(cv) can be a simple condition such as (x 10) or a combined condition such as B(cv)=(x 10 V y 5 V x+y 12) alternatively, use 3 condition vars B(cv1)=(x 10), B(cv2)=(y 5), B(cv3)=(x+y 12) leading to a single semaphore associated with all critical sections (e.g. POSIX). Usually, a single condition var. is used for all conditions hence, using more than one is an efficiency choice For example: JAVA allows a single implicit condition var. per object (actually, JAVA provides a Monitor mechanism) Rule: signal when a condition might have become true. 12

13 Signalling strategies The only problem remaining is the choice of signalling type. Two signalling strategies Signal one waiter of cv satisfying: B(cv) is true and there are waiters on it à Empty(cv)=false Sigall all waiters of the condition variable (of which the associated condition may have changed from false to true.) Which one to choose: Signal or Sigall Careful analysis leads to efficiency. Sigall is always correct, but inefficient. 13

14 POSIX: condition variables (1003.1c) Usage: 1) mutex lock 2) while not condition do Wait od; 3) critical section 4) possible signals 5) mutex unlock pthread_cond_t cond = PTHREAD_COND_INITIALIZER; status = pthread_cond_init (&cond, attr); /* should return 0 */ status = pthread_cond_destroy (&cond); /* idem */ status = pthread_cond_wait (&cond, m); /* semaphore m is associated with * all critical sections */ status = pthread_cond_timedwait (&cond, m, exp); /* exp: max. waiting time; returns * ETIMEDOUT after exp.*/ status = pthread_cond_signal (&cond); /* signal one waiter */ status = pthread_cond_broadcast (&cond); /* signal all waiters */ 14

15 Agenda Condition synchronization motivation condition variables monitors scheduling / signalling disciplines 15

16 Monitors Definition: a monitor is combination of data and operations (procedures, methods) on data in fact: an object, like in object-oriented languages Procedures of a monitor are executed under mutual exclusion. Procedure executing is said to be inside the monitor (only 1 can be inside) Synchronization is through condition variables. The effect on the caller of a signal depends on the monitor implementation some implementations give up the monitor immediately this signalling semantics is called: signalling discipline Communication is through the local variables of the monitor. 16

17 Example: just mutual exclusion Monitor Exclusion = [ { local variables } Proc CritSect1 = [ { implementation } ] ; Proc CritSect2 = [ { implementation } ] { initialization } ] { global variables } var Excl: Exclusion; Proc User1 = [ while true do... Excl.CritSect1;... od ] Proc User2 = [ while true do... Excl.CritSect2;... od ] 17

18 Example: readers-writers problem Reader Writer Database Reader Writer At any given time several readers (and no writers) or one writer (and no readers) may be active. à read/write actions are critical 18

19 Formalization Add entry and exit protocols around the read and write actions, in a similar way as for mutual exclusion. Variables nr and nw record the numbers of readers and writers. Proc Reader = [ while true do... nr := nr+1; Read actions ; nr := nr-1;... od ] Proc Writer = [ while true do... nw := nw+1; Write actions ; nw := nw-1;... od ] What is the invariant? Maintain I: (nr = 0 nw = 0) (nw 1) 19

20 Maintain the invariant From topology: I0: 0 nr I1: 0 nw From topology: precondition before the decrements of nr (resp. nw): nr>0 nw>0 From topology: compute preconditions for those statements that might disturb the invariant. I(nr := nr+1) = { substitution } = (nr+1= 0 nw = 0) nw 1 (nr = -1 nw = 0) nw 1 = { topology: nr 0 } nw = 0 I(nw := nw+1) = { substitution } The other assignments (the decrements) are true since they won t disturb I. = (nr= 0 nw+1= 0) (nw+1 1) (nr = 0 nw = -1) nw 0 = { topology: nw 0 } nr = 0 nw = 0 20

21 Required assertions Proc Reader = [ while true do... { nw=0 } nr := nr+1; Read actions ; { true } nr := nr-1;... od ] Proc Writer = [ while true do... { nr=0 nw=0 } nw := nw+1; Write actions ; { true } nw := nw-1;... od ] The monitor method requires that all accesses to the relevant variables are in critical sections. The italic (red) parts must be in critical sections. The statements don t have to be atomic. 21

22 Four critical sections { nw=0 } nr := nr+1; A { nr = 0 nw=0 } nw := nw+1; C { true } nr := nr-1; B { true } nw := nw-1; D Method: Introduce one condition variable per assertion; Introduce a monitor, with a method per critical section; Perform a systematic translation/implementation. 22

23 Adapting the text { global variable } var RW: ReaderWriter; Proc Reader = [ while true do... RW.Rentry; Read actions ; RW.Rexit; od ] Proc Writer = [ while true do... RW.Wentry; Write actions ; RW.Wexit od ] 23

24 Full program text of ReaderWriter Monitor ReaderWriter = [ var nr, nw: int; Rblock, { nw=0 } Wblock { nw=0 nr=0 }: Condition; Proc Rentry = [ while nw>0 do Wait (Rblock) od; { nw=0 } nr := nr+1 MonExit ] ; Proc Rexit = { nr>0 nw=0 } [ nr := nr-1; MonExit ] ; Proc Wentry = [ while nw>0 nr>0 do Wait (Wblock) od; { nw=0 nr=0 } nw := nw+1 MonExit ] ; Proc Wexit = { nr=0 nw>0 } [ nw := nw-1; MonExit ] ; { initialization } nr := 0; nw := 0 ] 24

25 MonExit: Many possibilities... This is where the signalling takes place. Proc MonExit = [ if Empty(Wblock) nw=0 nr=0 then Signal (Wblock) else if Empty(Rblock) nw=0 then Signal (Rblock) fi fi ] ; Proc MonExit = [ if nw=0 then Signal (Rblock) fi; if nw=0 nr=0 then Signal (Wblock) fi ] ; Proc MonExit = [ Signal (Rblock); Signal (Wblock) ] ; 25

26 Alternatively,... Sigall every condition that may have become true during critical section. maintain system invariants, while blocking only if guard holds. Proc Rentry = [ while nw>0 do Wait (Rblock) od; nr := nr+1 ] ; Proc Rexit = [ nr := nr-1; if nr=0 then Sigall (Wblock) fi { or Signal } ] ; Proc Wentry = [ while nw>0 nr>0 do Wait (Wblock) od; nw := nw+1 ] ; Proc Wexit = [ nw := nw-1; Sigall (Rblock); Sigall (Wblock) { or Signal } ] ; The signaller did not really have to check if { nr=0 } holds or not. It could as well rely on the signalled processes to (re)check if the condition { nw=0 nr=0 } holds. But, would that be efficient? 26

27 Agenda Condition synchronization motivation condition variables monitors scheduling / signalling disciplines 27

28 Structuring by monitors Condition variables are rather useless without combining with proper mutual exclusion. Monitors provide the exclusion. At most one thread may be inside the monitor at any given time. Programs with monitors employ: active processes, passive monitors relevant shared variables are encapsulated well-defined operations on shared variables Question: Which process is in the monitor right after the signal? The answer depends on the signalling discipline. 28

29 Scheduling/signalling disciplines The discipline defines what happens to the monitor upon a signal. Four disciplines are used in various implementations signal & exit signal & continue signal & wait signal & urgent wait Correctness of solution depends on signalling discipline! 29

30 Signal and Exit The process executing a signal exits the monitor immediately. Monitor access is given to a waiter on that variable, if any. Sigall is not supported Signalling strategy: upon leaving the monitor, a process performs at most one signal on a condition variable that is non-empty and for which the corresponding condition holds. Property: The condition, i.e. B(cv), holds after Wait. 30

31 Signal and Continue The process executing a signal continues to use the monitor, until a Wait or until the end of the routine. Any processes released by this signal compete with the other processes to obtain monitor access again. Signalling strategy: during execution of a monitor routine all relevant conditions are signalled. after each wait, the condition is evaluated again. Property: The condition may or may not hold after Wait. 31

32 Signal and (Urgent) Wait The process executing a signal is stopped in favour of the signalled process. The signaller waits to access the monitor again after the Signal, and competes with all other processes again. Urgent wait: signaller has priority over other users. Signalling strategy: similar to Signal & Exit. signalling is done upon leaving the monitor. Property: The condition holds after Wait. 32

33 General strategies Use a repetition to evaluate and wait on a guard. most disciplines have unpredictability in the choice of the next process in the monitor Upon each monitor exit, SIGNAL: employ cascaded wakeup by using just Signal(cv) if B(cv) holds and cv is not empty, SIGALL: wake up the entire group waiting on each variable cv for which B(cv) may have become true. Signal at the end of a routine. 33

34 General strategies (cnt d) Do not change the state before waiting (otherwise, signalling has to occur there as well). Beware that monitor entry and exits include the Wait(). By not modifying the state, signalling is not needed before the Wait() Two ways to determine which variable to signal: Just Signal (resp. Sigall in 2 nd strategy) each cv with a true guard. Evaluate the status of each cv and don t signal more than necessary. E.g. only wakeup a single waiter, which then needs to properly cascade this to other waiters. In Sigall strategy several conditions per cv can be used; the Sigall must then be performed if any of these conditions may have become true. e.g. Java has a single, implicit cv per class. 34

35 Notes Too much signalling is not wrong! It may only be less efficient. Most signalling disciplines are unfair because of competition between signalled processes and new processes. In principle, one condition variable is enough (as in Java), more condition variables may increase efficiency. 35

36 Synchronization: summary Action synchronization allows systematically introducing semaphores requires explicit synchronization invariants on actions / action counts. Condition synchronization principle: At places where the truth of a condition is required: check and block At places where a condition may have become true: signal waiters Signalling strategy vs efficiency. 36