Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
The following code example shows how an atomicity-violation bug can be fixed by_ 1 pthread_mutex_t proc_info_lock PTHREAD_MUTEX_INITIALIZER; Thread 1:: pthread_mutex_lock (sproc_info_lock); if (thd->proc_info) ( fputs (thd->proc_info, ...); 7. pthread_mutex_unlock (sproc_info_lock); 10 Thread 2:: pthread mutex_lock (&proc_info_lock); 12 thd->proc_info - NULL; pthread mutex_unlock (&proc_info_lock); 11 13 adding more thread parallelism avoiding deadlocks removing the shared variable adding locks around the shared variable references

The following code example shows how an atomicity-violation bug can be fixed by_ 1 pthread_mutex_t proc_info_lock PTHREAD_MUTEX_INITIALIZER; Thread 1:: pthread_mutex_lock (sproc_info_lock); if (thd->proc_info) ( fputs (thd->proc_info, ...); 7. pthread_mutex_unlock (sproc_info_lock); 10 Thread 2:: pthread mutex_lock (&proc_info_lock); 12 thd->proc_info - NULL; pthread mutex_unlock (&proc_info_lock); 11 13 adding more thread parallelism avoiding deadlocks removing the shared variable adding locks around the shared variable references

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
The following code example shows how an atomicity-violation bug can be fixed by pthread_mutex_t proc_info_lock = PTHREAD_MUTEX_INITIALIZER; 2 Thread 1:: pthread_mutex_lock (sproc_info_lock); if (thd->proc_info) { fputs (thd->proc_info, ...); 7 pthread_mutex_unlock (&proc_info_lock); 10 Thread 2:: pthread mutex_lock (&proc_info_lock); thd->proc_info = NULL; pthread_mutex_unlock (sproc_info_lock); 11 12 13 adding more thread parallelism avoiding deadlocks removing the shared variable adding locks around the shared variable references
Transcribed Image Text:The following code example shows how an atomicity-violation bug can be fixed by pthread_mutex_t proc_info_lock = PTHREAD_MUTEX_INITIALIZER; 2 Thread 1:: pthread_mutex_lock (sproc_info_lock); if (thd->proc_info) { fputs (thd->proc_info, ...); 7 pthread_mutex_unlock (&proc_info_lock); 10 Thread 2:: pthread mutex_lock (&proc_info_lock); thd->proc_info = NULL; pthread_mutex_unlock (sproc_info_lock); 11 12 13 adding more thread parallelism avoiding deadlocks removing the shared variable adding locks around the shared variable references
The following code structures show how semaphores empty and full can be used to solve Producer/Consumer (Bounded-Buffer with n buffers) problem. • The structure of the producer • The structure of the consumer while (true) { while (true) { wait (full) /* produce an item / wait (mutex), --. wait (empty); /* remove an item from buffer */ wait (mutex) ; ... poat (mutex) ; /* add to the buffer */ poat (empty); /* consume the item */ post (mutex); post (full); ... What is the purpose of the mutex in these two code structures? O It indicates the number of empty slots in the buffer. O It ensures that semaphores empty and full are both binary semaphores. O It indicates the number of occupied slots in the buffer. O It ensures mutual exclusion.
Transcribed Image Text:The following code structures show how semaphores empty and full can be used to solve Producer/Consumer (Bounded-Buffer with n buffers) problem. • The structure of the producer • The structure of the consumer while (true) { while (true) { wait (full) /* produce an item / wait (mutex), --. wait (empty); /* remove an item from buffer */ wait (mutex) ; ... poat (mutex) ; /* add to the buffer */ poat (empty); /* consume the item */ post (mutex); post (full); ... What is the purpose of the mutex in these two code structures? O It indicates the number of empty slots in the buffer. O It ensures that semaphores empty and full are both binary semaphores. O It indicates the number of occupied slots in the buffer. O It ensures mutual exclusion.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS