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; fill= (fill + 1) MAX; 21 int tmp buffer [use]; use (use + 1) MAX; return tmp; } } void void producer (void arg) { int i; for (i = 0; i < loops; i++) { sem wait (Gempty); sem wait (6mutex); put (1); sem post (smutex); sem post (full); // Line Fl // Line F2 // Line Gl // Line G2 } consumer (void arg) ( int i; for (i = 0; i < loops; i++) sem wait (full); sem wait (6mutex); int tap = get (); sem post (6mutex); sem post (sempty); printf("d\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?
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; fill= (fill + 1) MAX; 21 int tmp buffer [use]; use (use + 1) MAX; return tmp; } } void void producer (void arg) { int i; for (i = 0; i < loops; i++) { sem wait (Gempty); sem wait (6mutex); put (1); sem post (smutex); sem post (full); // Line Fl // Line F2 // Line Gl // Line G2 } consumer (void arg) ( int i; for (i = 0; i < loops; i++) sem wait (full); sem wait (6mutex); int tap = get (); sem post (6mutex); sem post (sempty); printf("d\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?
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
![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;
fill= (fill + 1) MAX;
21
int tmp buffer [use];
use
(use + 1) MAX;
return tmp;
}
}
void
void producer (void arg) {
int i;
for (i = 0; i < loops; i++) {
sem wait (Gempty);
sem wait (6mutex);
put (1);
sem post (smutex);
sem post (full);
// Line Fl
// Line F2
// Line Gl
// Line G2
}
consumer (void arg) (
int i;
for (i = 0; i < loops; i++)
sem wait (full);
sem wait (6mutex);
int tap = get ();
sem post (6mutex);
sem post (sempty);
printf("d\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?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8c247e94-aadc-4ba9-befa-a63b46c0c923%2F1eb04d39-6802-48cd-a294-584846df92c5%2F369jwtd_processed.png&w=3840&q=75)
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;
fill= (fill + 1) MAX;
21
int tmp buffer [use];
use
(use + 1) MAX;
return tmp;
}
}
void
void producer (void arg) {
int i;
for (i = 0; i < loops; i++) {
sem wait (Gempty);
sem wait (6mutex);
put (1);
sem post (smutex);
sem post (full);
// Line Fl
// Line F2
// Line Gl
// Line G2
}
consumer (void arg) (
int i;
for (i = 0; i < loops; i++)
sem wait (full);
sem wait (6mutex);
int tap = get ();
sem post (6mutex);
sem post (sempty);
printf("d\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?
AI-Generated Solution
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution
Similar questions
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