Instructions:
All the assignments should be completed and uploaded by 5 pm.
Markings will be based on the correctness and soundness of the outputs. Marks will be deducted in case of plagiarism.
Proper indentation and appropriate comments are mandatory.
You should zip all the required files and name the zip file as roll_no .zip , eg.
1501cs11.zip.
Upload your assignment ( the zip file ) in the following link: https://www.dropbox.com/request/K2bseIFfiQvdIIrzmjKv
In this assignment, you implement a semaphore-based solution to the bounded buffer producer/consumer problem.
The buffer is manipulated with two functions, insert_item() and remove_item() ,which are called by the producer and consumer threads, respectively. After you complete (by using semaphores) the insert_item() and remove_item() functions, these functions will synchronize the producer and consumer threads. You must use three semaphores: empty and full ,which count the number of empty and full slots in the buffer, and mutex ,which is a binary (or mutual exclusion) semaphore that protects the actual insertion or removal of items in the buffer (i.e., the critical section).
The main() function initializes the buffer and creates separate producer and consumer threads. Once it has created the producer and consumer threads, the main() function will sleep for a period of time and, upon awakening, will terminate the application. The main() function is passed three parameters on the command line:
How long to sleep before terminating
The number of producer threads
The number of consumer threads
The producer thread alternates between sleeping for a random period of time and inserting a random integer into the buffer. The consumer thread sleeps for a random period of time and, upon awakening, attempts to remove an item from the buffer.
