Process Synchronization: Producer-Consumer Problem The purpose of this programming project is to explore process synchronization. This will be accomplished by writing a program on the Producer / Consumer problem described below. Your simulation will be implemented using Pthreads. This assignment is a modification to the programming project The Producer Consumer Problem found at the end of Chapter 7 of our textbook. 1. Your program must be written using C or C++ and you are required to use the Pthread with mutex and semaphore libraries. In chapter 3, we discussed how a “bounded buffer” could be used to enable producer and consumer processes to share memory. We described a technique using a circular buffer that can hold BUFFER_SIZE-1 items. By using a shared memory location count, the buffer can hold all BUFFER_SIZE items. This count is initialized to 0 and is incremented every time an item is placed into the buffer and decremented every time an item is removed from the buffer. The count data item can also be implemented as a counting semaphore. The producer can place items into the buffer only if the buffer has a free memory location to store the item. The producer cannot add items to a full buffer. The consumer can remove items from the buffer if the buffer is not empty. The consumer must wait to consume items if the buffer is empty. The “items” stored in this buffer will be integers. Your producer process will have to insert random numbers into the buffer. The consumer process will consume a number. Assignment Specifications The buffer used between producer and consumer processes will consist of a fixed-size array of type buffer_item. The queue of buffer_item objects will be manipulated using a circular array. The buffer will be manipulated with two functions, buffer_insert_item() and buffer_remove_item(), which are called by the producer and consumer threads, respectively. A skeleton outlining these functions can be found in buffer.h (provided below). Skeleton outlining (Buffer.h) #ifndef _BUFFER_H_DEFINED_ #define _BUFFER_H_DEFINED_ typedef int buffer_item; #define BUFFER_SIZE 5 bool buffer_insert_item( buffer_item item ); bool buffer_remove_item( buffer_item *item ); #endif // _BUFFER_H_DEFINED_ The buffer_insert_item() and buffer_remove_item() functions will synchronize the producer and consumer using the algorithms. The buffer will also require an initialization function (not supplied in buffer.h) that initializes the mutual exclusion object “mutex” along with the “empty” and “full” semaphores. The producer thread will alternate between sleeping for a random period of time and generating and inserting (trying to) an integer into the buffer. Random numbers will be generated using the rand_r() function. See the text on page 290 for an overview of the producer algorithm. The consumer thread will alternate between sleeping for a random period of time (thread safe of course) and (trying to) removing a number out of the buffer. See the text on page 290 for an overview of the consumer algorithm. The main function will initialize the buffer and create the separate producer and consumer threads. Once it has created the producer and consumer threads, the main() function will sleep for duration of the simulation. Upon awakening, the main thread will signal other threads to quit by setting a simulation flag which is a global variable. The main thread will join with the other threads and then display the simulation statistics. The main() function will be passed two parameters on the command line: The length of time the main thread is to sleep before terminating (simulation length in seconds) The maximum length of time the producer and consumer threads will sleep prior to producing or consuming a buffer_item A skeleton for the main function appears as: #include
Looking for a solution written from scratch with No plagiarism and No AI?
WHY CHOOSE US?
We deliver quality original papers |
Our experts write quality original papers using academic databases.We dont use AI in our work. We refund your money if AI is detected |
Free revisions |
We offer our clients multiple free revisions just to ensure you get what you want. |
Discounted prices |
All our prices are discounted which makes it affordable to you. Use code FIRST15 to get your discount |
100% originality |
We deliver papers that are written from scratch to deliver 100% originality. Our papers are free from plagiarism and NO similarity.We have ZERO TOLERANCE TO USE OF AI |
On-time delivery |
We will deliver your paper on time even on short notice or short deadline, overnight essay or even an urgent essay |