Cse325(OS) amherst candy factory problem
Download as PPTX, PDF1 like194 views
The document outlines a project on the producer-consumer problem within the context of an assembly line at the Amherst Candy Factory. It describes how producer threads generate different types of candies while consumer threads package them, using a bounded buffer for synchronization via semaphores. Real-life examples of this model include audio-video players and web servers.
Cse325(OS) amherst candy factory problem
- 1. Welcome
- 2. Kazi Mostaq Hridoy Id: 2019-1-60-098 Md. Asad Chowdhury Dipu Id: 2019-1-60-093 Md. Mizanur Rahman Riad Khan Id: 2019-1-60-108 Presented By
- 4. Problem Description Amherst candy factory implements an assembly line using bounded buffer Producer thread produces a certain type of candy, while each consumer creates boxes of assorted candies using ones produced by producers. After producing each candy, the producer deposits them into the bounded buffer until the buffer gets full. A consumer fills up a box of assorted candy when i candy items have been extracted. Producer thread produces a candy; consumer creates boxes of candies using produced candies
- 8. OUTPUT
- 9. Conclusion In this project, we have showed the scenario of a producer consumer management of a candy factory. We showed a list of list candies that are to be produced. Producer produces several types of candies and consumers are consuming the candies after a minimum number of candies getting packed. We have used semaphores in order to maintain synchronization.
- 10. Real Life Examples • Producer-Consumer Audio-Video player: network and display threads; shared buffer. Web server: master thread and slave thread