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
icon
Related questions
Question
3
Consider the following implementation of the producer-consumer
code:
and
15
14
int buffer (MAX);
int fill= 0;
int use = 0;
void put (int value) (
}
int get() (
}
1
TT
21
buffer[fill] = value;
// Line Fl
fill= (fill + 1) MAX; // Line F2
21
int tmp buffer[use];
use (use + 1) MAX;
return tmp;
void producer (void arg) {
int i;
for (i = 0; i < loops; i++) {
sem wait (Gempty);
sem wait (6mutex);
put (1);
sem post (6mutex);
sem post (full);
}
}
void
// Line Gl
// Line G2
*consumer (void varg) (
int i;
for (i=0; i < loops; i++)
}
sem wait (full);
sem wait (6mutex);
int tmp = get();
sem post (6mutex);
sem post (sempty);
printf("\n", tmp);
// Line Pl
// Line P1.5 (MUTEX HERE)
// Line P2
// Line P2.5 (AND HERE)
// Line P3
{
// Line Cl
// Line C1.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?
b. Is anyone waiting to get into a critical section? How
do you know?
c. How many valid elements are in the buffer? How do
you know?
d. If someone is in a critical section, what are the
possible lines they are executing?
e. Now assume the following (mutex=-1, empty = 14).
a. Is anyone in a critical section? How do you know?
b. Is anyone waiting to get into a critical section? How
do you know?
c. How many valid elements are in the buffer? How do
you know?
d. If someone is in a critical section, what are the
possible lines they are executing?
Transcribed Image Text:3 Consider the following implementation of the producer-consumer code: and 15 14 int buffer (MAX); int fill= 0; int use = 0; void put (int value) ( } int get() ( } 1 TT 21 buffer[fill] = value; // Line Fl fill= (fill + 1) MAX; // Line F2 21 int tmp buffer[use]; use (use + 1) MAX; return tmp; void producer (void arg) { int i; for (i = 0; i < loops; i++) { sem wait (Gempty); sem wait (6mutex); put (1); sem post (6mutex); sem post (full); } } void // Line Gl // Line G2 *consumer (void varg) ( int i; for (i=0; i < loops; i++) } sem wait (full); sem wait (6mutex); int tmp = get(); sem post (6mutex); sem post (sempty); printf("\n", tmp); // Line Pl // Line P1.5 (MUTEX HERE) // Line P2 // Line P2.5 (AND HERE) // Line P3 { // Line Cl // Line C1.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? b. Is anyone waiting to get into a critical section? How do you know? c. How many valid elements are in the buffer? How do you know? d. If someone is in a critical section, what are the possible lines they are executing? e. Now assume the following (mutex=-1, empty = 14). a. Is anyone in a critical section? How do you know? b. Is anyone waiting to get into a critical section? How do you know? c. How many valid elements are in the buffer? How do you know? d. If someone is in a critical section, what are the possible lines they are executing?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question
  1. Now assume the following (mutex=-1, empty = 14).
    1. Is anyone in a critical section? How do you know?  
    2. Is anyone waiting to get into a critical section? How do you know?  
    3. How many valid elements are in the buffer? How do you know? 
    4. If someone is in a critical section, what are the possible lines they are executing? 
Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Arrays
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