Question: 01] Suppose a system has an atomic hardware instruction SHIFT, that does the follows: SHIFT (int *A, *B)1{ *B-*A; / ATOMICALLY *A=0 A] Implement Dijkstra
![01] Suppose a system has an atomic hardware instruction SHIFT, that](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3b600d923b_87266f3b60078758.jpg)
![does the follows: SHIFT (int *A, *B)1{ *B-*A; / ATOMICALLY *A=0 A]](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3b60176d4e_87366f3b6010fd87.jpg)

![utilize busy waiting. B] Implement blocking semaphores using the shift instructions](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3b602a973a_87466f3b60250d4f.jpg)
01] Suppose a system has an atomic hardware instruction SHIFT, that does the follows: SHIFT (int *A, *B)1{ *B-*A; / ATOMICALLY *A=0 A] Implement Dijkstra style semaphores with the shift instruction, that is, semaphores which utilize busy waiting. B] Implement blocking semaphores using the shift instructions
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
