Assoc. Prof. Dr. Alp Kut

Res. Assist. Bora İ. Kumova, kumova@cs.deu.edu.tr, cs.deu.edu.tr/~kumova, 3736040->107

• Mutual exclusion algorithm, Tanenbaum 92, pp. 476
• 1 producer, n consumers, 1 buffer of size 1
• The producer writes, in an endless loop, succeeding integer values into a buffer. The buffer can contain at most one value. This value is also displayed in a scrollbar, for visual validation.
• Each consumer, concurrently to the others, tries to get the value from the buffer. After the value of the buffer is read, the buffer is cleared. Thus, more than one consumer cannot read the same value ! Each consumer displays the value it has read in its own scrollbar.
• Example:

• 1+n programmes must be written. If consumer is designed object-oriented, then only one consumer need to be programmed, but n instances of that programme must be started !
• All objects (1+n) will run as independent processes in a single HTML page

• 1 producer scrollbar, n consumer scrollbars
• 1 start and 1 stop button for each producer/consumer to start/stop producing/consuming a value, respectively