Consider the following implementation of the producer-consumer code: and 4 12 int buffer (MAX); int fill= 0; int une 0j . w int get() ( 19 13 void put (int value) ( buffer (fill] = value; fill=(fill 1) MAX; 1 1 T . M 11 12 11 14 11 H 17 W int tap buffer[use]; use (use + 1) MAX; return tmp/ // Line Pl // Line P2 void producer (void arg) ( int i ) // Line Gl // Line G2 for (i =0; i < loops; i++) sem_wait (6empty) sem wait (6mutex); put (1) sem post (smutex); sem post (full); } void consumer (void *arg) ( int i for (i = 0; i < loopa; i++) sem wait (6full); nem wait (6mutex); int tap get(); sem post (smutex); sem post (6empty); printf("d\n", tmp); ( // Line Pl // Line P1.5 (MUTEX HERE) // Line P2 // Line P2.5 (AND HERE) // Line P3 ( // Line Cl // Line Cl.5 (MUTEX HERE) // Line C2 // Line C2.5 (AND HERE) // Line C3 Let's assume MAX is 50. a. What's the initial value of mutex? Why? b. What's the initial value of empty? Why? c. What's the initial value of full (full, not fill)? Why? d. Assume the following (mutex-1, full = 22). a. Is anyone in a critical section? How do you know?
Consider the following implementation of the producer-consumer code: and 4 12 int buffer (MAX); int fill= 0; int une 0j . w int get() ( 19 13 void put (int value) ( buffer (fill] = value; fill=(fill 1) MAX; 1 1 T . M 11 12 11 14 11 H 17 W int tap buffer[use]; use (use + 1) MAX; return tmp/ // Line Pl // Line P2 void producer (void arg) ( int i ) // Line Gl // Line G2 for (i =0; i < loops; i++) sem_wait (6empty) sem wait (6mutex); put (1) sem post (smutex); sem post (full); } void consumer (void *arg) ( int i for (i = 0; i < loopa; i++) sem wait (6full); nem wait (6mutex); int tap get(); sem post (smutex); sem post (6empty); printf("d\n", tmp); ( // Line Pl // Line P1.5 (MUTEX HERE) // Line P2 // Line P2.5 (AND HERE) // Line P3 ( // Line Cl // Line Cl.5 (MUTEX HERE) // Line C2 // Line C2.5 (AND HERE) // Line C3 Let's assume MAX is 50. a. What's the initial value of mutex? Why? b. What's the initial value of empty? Why? c. What's the initial value of full (full, not fill)? Why? d. Assume the following (mutex-1, full = 22). a. Is anyone in a critical section? How do you know?
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
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question
- Now assume the following (mutex=-1, empty = 14).
- Is anyone in a critical section? How do you know?
- Is anyone waiting to get into a critical section? How do you know?
- How many valid elements are in the buffer? How do you know?
- If someone is in a critical section, what are the possible lines they are executing?
Solution
by Bartleby Expert
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education