1. In is 001110 a legal output for a sequentially consistent memory? Explain your answer.

2. At the end of, we discussed a formal model that said every set of operations on a sequentially consistent memory can be modeled by a string, S, from which all the individual process sequences can be derived. For processes P1 and P2 in give all the possible values of S. Ignore processes P3 and P4 and do not include their memory references in S.


Save your time - order a paper!

Get your paper written from scratch within the tight deadline. Our service is a reliable solution to all your troubles. Place an order on any task and we will take care of it. You won’t have to worry about the quality and deadlines

Order Paper Now