CS 3733 Operating Systems

Reading: Tanenbaum pages 33-38 (Section 2.2)

• Answer questions on laboratory 4

• Implementation of a shared circular buffer

      item buffer[n];
      int in,out,counter;
  

  in points to the next free buffer
  out points to the first full buffer
  counter contains the number of full buffers.

  Pool is empty when counter = 0 and is full when counter = n.

  Producer loop:

     produce an item in nextp
     while (counter == n) ;
     buffer[in] = nextp;
     in = (in+1) % n;
     counter++;
    in = (in+1) % n;
     counter++;
  

  Consumer loop:

     while (counter == 0) ;
     nextc = buffer[out];
     out = (out+1) % n;
     counter--;
     consume the item in nextc
  

  Although each routine is correct by itself, they do not function correctly when run concurrently. How are counter++ and counter-- implemented?

• Test-and-Set (Example 8.5 of PUP)

• Implementation of the bounded buffer synchronization using Test-and-Set.

• Critical section is a section of code which must be executed mutually exclusively in time. Generally it has the following structure:
  • Entry section
  • Critical section
  • Exit section
  • Remainder section
  A key point in implementing critical section problems is to distinguish between parts of the code that execute quickly and those that may take arbitrarily long (such as segments containing sleeps). The latter parts should not be part of the critical section.

• Solutions must satisfy:
  • Mutual exclusion
  • Progress
  • Bounded waiting

• Example:
  Does the following code solve the critical section problem? (Tanenbaum page 36)

  PROCESS 1:                        PROCESS 2:
  while(TRUE) {                     while(TRUE) {
     while (turn != 0) ;               while (turn != 1) ;
                       
     turn = 1;                         turn = 0;
                   
  }                                }
  

  ---

  Revision Date: 10/25/97

  ---