Shared register
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In distributed computing, shared-memory systems and message-passing systems are two widely studied methods of interprocess communication. In shared-memory systems, processes communicate by accessing shared data structures. A shared (read/write) register, sometimes just called a register, is a fundamental type of shared data structure which stores a value and has two operations: read, which returns the value stored in the register, and write, which updates the value stored. Other types of shared data structures include read–modify–write, test-and-set, compare-and-swap etc. The memory location which is concurrently accessed is sometimes called a register.
In distributed computing, shared-memory systems and message-passing systems are two widely studied methods of interprocess communication. In shared-memory systems, processes communicate by accessing shared data structures. A shared (read/write) register, sometimes just called a register, is a fundamental type of shared data structure which stores a value and has two operations: read, which returns the value stored in the register, and write, which updates the value stored. Other types of shared data structures include read–modify–write, test-and-set, compare-and-swap etc. The memory location which is concurrently accessed is sometimes called a register. {{image frame|align=center|caption=Shared Register Stages of Constructions|width=700 |content= {\operatorname{Message-passing} \atop (MP)\ System} ->[][\text{Stage 1}] SWSR\ atomic ->[][\text{Stage 2}] SWMR ->[][\text{Stage 3}] SW\ snapshot ->[][\text{Stage 4}] MWMR }} An implementation is linearizable if, for every execution there is a linearization ordering that satisfies the following two properties: if operations were done sequentially in order of their linearization, they would return the same result as in the concurrent execution. If operation op1 ends before operation op2 begins, then op1 comes before op2 in linearization.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1347948051 under CC BY-SA 4.0; modifications have been made.