Scribd Logo
Upload

Welcome to Scribd!

  • 278 views

    Implementation of Producer-Consumer Problem Using Semaphores Program

    Uploaded by

    Vasantha Kumari
    This document describes a C program that implements the producer-consumer problem using semaphores to synchronize access to a shared buffer. The program uses three semaphores - mutex, full, and empty to control access to the buffer and coordinates a producer that adds items and a consumer that removes items from the buffer. The main function contains a menu that allows selecting the producer or consumer role and uses switches to call their respective functions.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd

    Implementation of Producer-Consumer Problem Using Semaphores Program

    Uploaded by

    Vasantha Kumari
    278 views2 pages
    This document describes a C program that implements the producer-consumer problem using semaphores to synchronize access to a shared buffer. The program uses three semaphores - mutex, full, and empty to control access to the buffer and coordinates a producer that adds items and a consumer that removes items from the buffer. The main function contains a menu that allows selecting the producer or consumer role and uses switches to call their respective functions.

    Original Title

    4.doc

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document describes a C program that implements the producer-consumer problem using semaphores to synchronize access to a shared buffer. The program uses three semaphores - mutex, full, and empty to control access to the buffer and coordinates a producer that adds items and a consumer that removes items from the buffer. The main function contains a menu that allows selecting the producer or consumer role and uses switches to call their respective functions.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    278 views2 pages

    Implementation of Producer-Consumer Problem Using Semaphores Program

    Uploaded by

    Vasantha Kumari
    This document describes a C program that implements the producer-consumer problem using semaphores to synchronize access to a shared buffer. The program uses three semaphores - mutex, full, and empty to control access to the buffer and coordinates a producer that adds items and a consumer that removes items from the buffer. The main function contains a menu that allows selecting the producer or consumer role and uses switches to call their respective functions.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 2

    IMPLEMENTATION OF PRODUCER-CONSUMER

    PROBLEM USING SEMAPHORES

    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.PRODUCER\n2.CONSUMER\n3.EXIT\n”);
    while(1)
    {
    printf(“\nENTER YOUR CHOICE\n”);
    scanf(“%d”,&n);
    switch(n)
    {
    case 1:
    if((mutex==1)&&(empty!=0))
    producer();
    else
    printf(“BUFFER IS FULL”);
    break;
    case 2:
    if((mutex==1)&&(full!=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++;
    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);
    x--;
    mutex=signal(mutex);
    }

    You might also like