Below are the pseudocodes for a variation of the solution for the producer-consu

Question

Below are the pseudocodes for a variation of the solution for the producer-consumer problem. Explain what kind problem will happen?

full = new CSemaphore(0);      
empty = new CSemaphore(N);   

Producer process
    while(true) {
         . . .          
          produce a data item
         . . .           
          empty.wait();  
          . . .
     Write a data item to the buffer
          . . .
          full.signal();      
             . . .
}    

Consumer process
while(true) {
      . . .
        full.wait();        
        …
        Remove a data item from buffer
        …
        empty.signal();  
        // consume the data item
}

Deadlock may occur. Produce may write while the consumer is reading Consumer may suffer from starvation. The code is perfect and no problem will occur. Producer may suffer from starvation.

Explanation / Answer

full = new CSemaphore(0);      
empty = new CSemaphore(N);   

Producer process
    while(true) {
         . . .          
          produce a data item
         . . .           
          empty.wait();  
          . . .
     Write a data item to the buffer
          . . .
          full.signal();      
             . . .
}    

Consumer process
while(true) {
      . . .
        full.wait();        
        …
        Remove a data item from buffer
        …
        empty.signal();  
        // consume the data item
}

Related Questions

Navigate

• Browse (All)
• Browse B
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.