| http://dbpedia.org/ontology/abstract
|
Atomic semantics is a type of guarantee pr … Atomic semantics is a type of guarantee provided by a shared by several processors in a parallel machine or in a network of computers working together.Atomic semantics are very strong. An atomic register provides strong guarantees even when there is concurrency and failures. A read/write register R stores a value and is accessed by two basic operations: read and write(v). A read returns the value stored in R and write(v) changes the value stored in R to v.A register is called atomic if it satisfies the two following properties: 1) Each invocation op of a read or write operation: •Must appear as if it were executed at a single point τ(op) in time. •τ (op) works as follow:τb(op) ≤ τ (op) ≤ τe(op): where τb(op) and τe(op) indicate the time when the operation op begins and ends. •If op1 ≠ op2, then τ (op1)≠τ (op2) 2) Each read operation returns the value written by the last write operation before the read, in the sequence where all operations are ordered by their τ values. Atomic/Linearizable register: Termination: when a node is correct, sooner or later each read and write operation will complete. Safety Property (Linearization points for read and write and failed operations): Read operation:It appears as if happened at all nodes at some times between the invocation and response time. Write operation: Similar to read operation, it appears as if happened at all nodes at some times between the invocation and response time. Failed operation(The atomic term comes from this notion):It appears as if it is completed at every single node or it never happened at any node. Example : We know that an atomic register is one that is linearizable to a sequential safe register. The following picture shows where we should put the linearization point for each operation: An atomic register could be defined for a variable with a single writer but multi- readers (SWMR), single-writer/single-reader (SWSR), or multi-writer/multi-reader (MWMR). Here is an example of a multi-reader multi-writer atomic register which is accessed by three processes (P1, P2, P3). Note that R. read → v means that the corresponding read operation returns v, which is the value of the register. Therefore, the following execution of the register R could satisfies the definition of the atomic registers:R.write(1), R.read→1, R.write(3), R.write(2), R.read→2, R.read→2..write(3), R.write(2), R.read→2, R.read→2.
, 原子语义是计算机科学的一种并发同步机制。具体定义为： 一个寄存器R是原子的，如果满足下述两条：1. 每次读或写操作看起来执行于时刻τ(op)，工作如同： τb(op) ≤ τ (op) ≤ τe(op): 其中τb(op) 与 τe(op) 指出操作 op 开始与结束。 如果 op1 ≠ op2, 则 τ (op1)≠τ (op2) 2. 读操作返回在此之前最后一次写操作的结果。
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Atomic_register1.jpg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
2014
|
| http://dbpedia.org/ontology/wikiPageLength
|
2908
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
921182867
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Concurrency_control +
, http://dbpedia.org/resource/File:Atomic_MWMR1.jpg +
, http://dbpedia.org/resource/File:Atomic_register.jpg +
, http://dbpedia.org/resource/File:Atomic_register1.jpg +
, http://dbpedia.org/resource/Data_register +
, http://dbpedia.org/resource/Regular_semantics +
, http://dbpedia.org/resource/Safe_semantics +
, http://dbpedia.org/resource/Central_processing_unit +
, http://dbpedia.org/resource/Parallel_machine +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Concurrency_control +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Term +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Atomic_semantics?oldid=921182867&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Atomic_register1.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Atomic_MWMR1.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Atomic_register.jpg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Atomic_semantics +
|
| owl:sameAs |
http://dbpedia.org/resource/Atomic_semantics +
, http://www.wikidata.org/entity/Q4817341 +
, http://rdf.freebase.com/ns/m.0w1r +
, http://zh.dbpedia.org/resource/%E5%8E%9F%E5%AD%90%E8%AF%AD%E4%B9%89 +
, https://global.dbpedia.org/id/4TB4x +
|
| rdfs:comment |
Atomic semantics is a type of guarantee pr … Atomic semantics is a type of guarantee provided by a shared by several processors in a parallel machine or in a network of computers working together.Atomic semantics are very strong. An atomic register provides strong guarantees even when there is concurrency and failures. A read/write register R stores a value and is accessed by two basic operations: read and write(v). A read returns the value stored in R and write(v) changes the value stored in R to v.A register is called atomic if it satisfies the two following properties: 1) Each invocation op of a read or write operation:nvocation op of a read or write operation:
, 原子语义是计算机科学的一种并发同步机制。具体定义为： 一个寄存器R是原子的，如果满足下述两条：1. 每次读或写操作看起来执行于时刻τ(op)，工作如同： τb(op) ≤ τ (op) ≤ τe(op): 其中τb(op) 与 τe(op) 指出操作 op 开始与结束。 如果 op1 ≠ op2, 则 τ (op1)≠τ (op2) 2. 读操作返回在此之前最后一次写操作的结果。
|
| rdfs:label |
原子语义
, Atomic semantics
|
