Consistency Model and Synchronization Primitives in SDSMS
نویسندگان
چکیده
This paper is on the general discussion of memory consistency model like Strict Consistency, Sequential Consistency, Processor Consistency, Weak Consistency etc. Then the techniques for implementing distributed shared memory Systems and Synchronization Primitives in Software Distributed Shared Memory Systems are discussed. The analysis involves the performance measurement of the protocol concerned that is Multiple Writer Protocol. Each protocol has pros and cons. So, the problems that are associated with each protocol is discussed and other related things are explored. Keywords—Distributed System, Single owner protocol, Multiple owner protocol
منابع مشابه
A New Synchronization Scheme for Memory Consistency Model ( Extended Abstract )
Modernistic scalable multiprocessors are mostly built with a distributed-shared memory architecture. Large scale shared memory multiprocessors have long memory latencies for the remote memory access. And these latencies can quickly offset system performance earned from the exploitation of parallelism. In order to improve system performance, we must reduce memory latencies. The useful way for th...
متن کاملA Separation Logic for Fictional Sequential Consistency
To improve performance, modern multiprocessors and programming languages typically implement relaxed memory models that do not require all processors/threads to observe memory operations in the same order. To relieve programmers from having to reason directly about these relaxed behaviors, languages often provide efficient synchronization primitives and concurrent data structures with stronger ...
متن کاملA Technique for Execution of Written Values on Shared Variables
The current paper conceptualizes the technique of release consistency indispensable with the concept of synchronization that is user-defined. Programming model concreted with object and class is illustrated and demonstrated. The essence of the paper is phases, events and parallel computing execution .The technique by which the values are visible on shared variables is implemented. The second pa...
متن کاملCan Expensive Synchronization be Avoided in Weak Memory Models? (Brief Announcement)
Process coordination problems have been extensively addressed in the context of sequential consistency. However, modern shared-memory systems present a large variety of ordering constraints on memory accesses that are much weaker than sequential consistency. We re-addressed two fundamental process coordination problems in the context of weak memory models. We proved that many models cannot supp...
متن کاملWeak Memory Consistency Models
Process coordination problems have been extensively addressed in the context of sequential consistency. However, modern multiprocessors present a large variety of memory models that are anything but sequentially consistent. In these machines, the ordering constraints on memory accesses are few. We re-address two fundamental process coordination problems in the context of weak memory models. We ...
متن کامل