![]() To illustrate this better, consider the following example:Ī multi-processor system consists of four processors - P1, P2, P3 and P4, all containing cached copies of a shared variable S whose initial value is 0. However, they are not sufficient as they do not satisfy the Transaction Serialization condition. The above conditions satisfy the Write Propagation criteria required for cache coherence. If processor P1 reads the old value of X, even after the write by P2, we can say that the memory is incoherent. Propagating the writes to the shared memory location ensures that all the caches have a coherent view of the memory. This condition defines the concept of coherent view of memory. ![]() ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |