int QUEUE_IS_EMPTY; int QUEUE_IS_FULL; void generator(){ Object thing = generate(); pthread_mutex_lock(&qlock); if (QUEUE_IS_FULL){ pthread_cond_wait(&queue_not_full); } enqueue(thing); pthread_cond_signal(&queue_not_full); pthread_mutex_unlock(&qlock); } void consumer(){ pthread_mutex_lock(&qlock); Object thing = dequeue(); consume(thing); while (QUEUE_IS_EMPTY){ pthread_cond_wait(&queue_not_empty); } pthread_cond_signal(&queue_not_full); pthread_mutex_unlock(&qlock); } This code generates objects in generator(), and consumes them in consumer(). Objects are placed into a queue to be consumed, and this queue has a limited size. enqueue() adds an item to the queue, and dequeue() removes one. An item may not be enqueued if the queue is full, or dequeued if the queue is empty. You may assume that QUEUE_IS_EMPTY and QUEUE_IS_FULL always correctly indicate whether the queue is empty, full, or neither, even if they are not updated in these methods. There are three multithreading related errors in this code that could result in deadlocking or other undesirable behavior. What are they?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

26.

HomeExpert Q&AMy answers
 

Student question

Time to preview question:
00:09:49
int QUEUE_IS_EMPTY; int QUEUE_IS_FULL; void generator(){ Object thing = generate(); pthread_mutex_lock(&qlock); if (QUEUE_IS_FULL){ pthread_cond_wait(&queue_not_full); } enqueue(thing); pthread_cond_signal(&queue_not_full); pthread_mutex_unlock(&qlock); } void consumer(){ pthread_mutex_lock(&qlock); Object thing = dequeue(); consume(thing); while (QUEUE_IS_EMPTY){ pthread_cond_wait(&queue_not_empty); } pthread_cond_signal(&queue_not_full); pthread_mutex_unlock(&qlock); }

This code generates objects in generator(), and consumes them in consumer().

Objects are placed into a queue to be consumed, and this queue has a limited size. enqueue() adds an item to the queue, and dequeue() removes one. An item may not be enqueued if the queue is full, or dequeued if the queue is empty. You may assume that QUEUE_IS_EMPTY and QUEUE_IS_FULL always correctly indicate whether the queue is empty, full, or neither, even if they are not updated in these methods.

There are three multithreading related errors in this code that could result in deadlocking or other undesirable behavior. What are they?

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Generic Type
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education