smitham14,github

smitham14's Projects

producer-consumer-problem

The producer and consumer problem is easier and more reliable to solve and with condition variables than with semaphores. However here I wanted to use semaphores so we can see how they work. Parallel to the other program I wrote with condition variables, here I used two semaphores, one for buffer full, and one for buffer empty. The cool thing about Unix (counting) semaphores they have a value (as opposed to binary semaphores which don’t), so I basically used them as a buffer index. Each time a producer queues an element into buffer, the producer posts to the empty buffer semaphore. This will increment its value, and if it were 0 it would wake up consumer threads waiting on that semaphore. The consumer thread that waits on that semaphore, upon waking up it will decrement the value of the semaphore. So empty buffer semaphore basically follows up with the buffer index. The full buffer semaphore does the opposite. Consumer threads post to it when they dequeue from the buffer, which increments the semaphore value. And producer threads wait in them, which means they sleep if buffer is full, and decrement the semaphore value each time they add element to buffer. A mutex is used to protect access to buffer. This is not an ideal good producer-consumer implementation, and I believe there is possibility for race condition (Explained in the code: Final code--Producer-Consumer problem)

smitham14 Goto Github PK

smitham14's Projects

producer-consumer-problem

te-it

Recommend Projects

React

Vue.js

Typescript

TensorFlow

Django

Laravel

D3

Recommend Topics

javascript

web

server

Machine learning

Visualization

Game

Recommend Org

Facebook

Microsoft

Google

Alibaba

D3

Tencent