During online class we studied that, if the semaphore operations Wait and Signal are not executed atomically, then mutual exclusion may be violated. Assume that Wait and Signal are implemented as below: void Wait (Semaphore S) { while (S.count <= 0) {} s.count = s.count - 1; void Signal (Semaphore S) { S.count = s.count + 1; Code: (a) a) Build a scenario of context switches that includes two threads and permit to enter a critical section secured by a single mutex semaphore as a result of a lack of atomicity. wait(S) = {while S < 0; S--; } signal(S) = {S++;} Code: (b) b) Assume, S=1, P & Q protects a critical region with the semaphore S. Show that if one of these operations is not executed atomically, we may violate mutual exclusion.

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
Q.No.3.
During online class we studied that, if the semaphore operations Wait and Signal are not executed
atomically, then mutual exclusion may be violated. Assume that Wait and Signal are implemented as
below:
void Wait (Semaphore s) {
while (S.count <= 0) {}
s.count = s.count - 1;
void Signal (Semaphore S) {
S.count = S.count + 1;
Code: (a)
a) Build a scenario of context switches that includes two threads and permit to enter a critical section
secured by a single mutex semaphore as a result of a lack of atomicity.
wait(S) = {while S < 0; S--; }
signal(S) = {S++; }
Code: (b)
b) Assume, S=1, P & Q protects a critical region with the semaphore S. Show that if one of these
operations is not executed atomically, we may violate mutual exclusion.
Transcribed Image Text:Q.No.3. During online class we studied that, if the semaphore operations Wait and Signal are not executed atomically, then mutual exclusion may be violated. Assume that Wait and Signal are implemented as below: void Wait (Semaphore s) { while (S.count <= 0) {} s.count = s.count - 1; void Signal (Semaphore S) { S.count = S.count + 1; Code: (a) a) Build a scenario of context switches that includes two threads and permit to enter a critical section secured by a single mutex semaphore as a result of a lack of atomicity. wait(S) = {while S < 0; S--; } signal(S) = {S++; } Code: (b) b) Assume, S=1, P & Q protects a critical region with the semaphore S. Show that if one of these operations is not executed atomically, we may violate mutual exclusion.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Stack
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
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