semaphores, classic problems

ePAPER READ

DOWNLOAD ePAPER

main.metaprl.org

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

START NOW

The producer/consumer problem

Producer

Buffer

Consumer

Semaphore s = new Semaphore();

cobegin

/* Producer */

while(true) {

produce;

V(s);

} |

/* Consumer */

while(true) {

P(s);

consume;

}

coend

Computing Systems

http://www.cs.caltech.edu/cs134/cs134a October 10, 2001

The producer/consumer problem Producer Buffer Consumer Semaphore s = new Semaphore(); cobegin /* Producer */ while(true) { produce; V(s); } | /* Consumer */ while(true) { P(s); consume; } coend Computing Systems http://www.cs.caltech.edu/cs134/cs134a October 10, 2001

The bounded-buffer problem (Dijkstra 1968) • A producer produces data and adds it to a buffer. • A consumer consumes data from the buffer. • The buffer contains room for n values. Computing Systems http://www.cs.caltech.edu/cs134/cs134a October 10, 2001

Page 1 and 2: October 8, 2001 • Processes and c
Page 3 and 4: Multi-process mutual exclusion •
Page 5 and 6: Problems with these algorithms •
Page 7: Mutual-exclusion with semaphores
Page 11 and 12: Implementing semaphores • Most CP
Page 13 and 14: Normal semaphores struct Semaphore

semaphores, classic problems

Create successful ePaper yourself

Delete template?

Save as template?