Scribd
Upload
85 views

Producer Consuming Problem Using Semaphores

This document describes a C program to implement the producer-consumer problem using semaphores. The key steps are: 1. Declare variables like mutex, full, empty and a counter x. 2. Initialize the buffer size and maximum items to produce. 3. Get user input to select producer, consumer or exit. 4. If producer selected, check if buffer is full before producing item; if consumer selected check if buffer is empty before consuming. 5. Functions like wait() and signal() are used to implement semaphores for synchronized access to the shared buffer.

Uploaded by

Aman Verma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
85 views

Producer Consuming Problem Using Semaphores

This document describes a C program to implement the producer-consumer problem using semaphores. The key steps are: 1. Declare variables like mutex, full, empty and a counter x. 2. Initialize the buffer size and maximum items to produce. 3. Get user input to select producer, consumer or exit. 4. If producer selected, check if buffer is full before producing item; if consumer selected check if buffer is empty before consuming. 5. Functions like wait() and signal() are used to implement semaphores for synchronized access to the shared buffer.

Uploaded by

Aman Verma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Ex.

No:6 PRODUCER CONSUMER PROBLEM USING SEMAPHORES

AIM:
To write a C-program to implement the producer - consumer problem using
semaphores.
ALGORITHM:

Step 1: Start the program.


Step 2: Declare the required variables.
Step 3: Initialize the buffer size and get maximum item you want to produce.
Step 4: Get the option, which you want to do either producer, consumer or exit from the
operation.
Step 5: If you select the producer, check the buffer size if it is full the producer should not
produce the item or otherwise produce the item and increase the value buffer size.
Step 6: If you select the consumer, check the buffer size if it is empty the consumer should not
consume the item or otherwise consume the item and decrease the value of bufer size.
Step 7: If you select exit come out of the program.
Step 8: Stop the program.
PROGRAM:

#include<stdio.h>
int mutex=1,full-0,empty-3,x=0;
main)
int n;
void producer();
void consumer);
int wait(int);
int signal(int);
printf("n1.PRODUCERn2.CONSUMERn3.EXITn");
while(1) {
printf("nENTER YOUR CHOICEn");
scanf("%d",&n);
switchn)
{case 1:
if(mutex-=1)&&(empty!-0)
producer);
else
printf("BUFFER IS FULL");
break;
26 | Pa ge
case 2:
if(mutexx )&&(full!l-0))
consumer);
else
printf("BUFFER IS EMPTY"%
break:
case 3:
exit(0);
break;

int wait(int s) {
return(--s); }
int signal(int s) {
return(++s); }
void producer() {
mutex=wait(mutex);
full-signal(full);
empty-wait(empty);
X+t;
printf("nproducer produces the item%d",x);
mutex=signal(mutex); }
void consumer() {
mutex-wait(mutex);
full-wait(full);
empty-signal(empty);
printf("n consumer consumes item%d",x);

mutex=signal(mutex);}

You might also like