Live briefing
Everything about Atomic semantics
Atomic semantics is a type of guarantee provided by a data register 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Atomic semanticsA 5-minute orientation
- Pick up a classic book: A structural inquiry into the symbolic representation of ideasThe most-reprinted book on the subject
- Read the landmark paper: Aesthetic semantics: Affect rating of atomic visual web aesthetics for use in affective user experience designCited 25 times
- Go sideways: Regular semanticsA closely related topic
- Go sideways: Shared registerA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Aesthetic semantics: Affect rating of atomic visual web aesthetics for use in affective user experience design
Single global lock semantics in a weakly atomic STM
Partial order and contextual net semantics for atomic and locally atomic CC programs
Atomic semantics of nonatomic programs
Proof-Theoretic Semantics and Atomic Base
Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
A formal semantics of nested atomic sections with thread escape
‘True Concurrency’ Semantics for Time Petri Nets with Weak Time and Persistent Atomic Policies
📚 Books worth reading
- 📕A structural inquiry into the symbolic representation of ideasArnolds Grava · 1969
- 📕Conceptual atomism and justificationist semanticsManuel Eugen Bremer · 2008
The "fixation factor" in alcohol addictionRobert Freed Bales · 1944- 📕Psychological effects of the atomic attacks on JapanIrving Lester Janis · 1950
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Regular semantics Regular semantics is a computer hardware consistency model. It describes a type of guarantee provided by a processor register that is shared by several…
- Shared register In distributed computing, shared-memory systems and message-passing systems are two widely studied methods of interprocess communication. In shared-memory…
- Linearizability In concurrent programming, an operation (or set of operations) is linearizable if it consists of an ordered list of invocation and response events, that…
- Shared snapshot objects In distributed computing, a shared snapshot object is a type of data structure, which is shared between several threads or processes. For many tasks, it…
- M-tree In computer science, M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle…
- Safe semantics Safe semantics is a computer hardware consistency model. It describes one type of guarantee that a data register provides when it is shared by several…
- Consistency model In computer science, a consistency model specifies a contract between the programmer and a system, wherein the system guarantees that if the programmer…
- ACID In computer science, ACID (atomicity, consistency, isolation, durability) is a set of properties of database transactions intended to guarantee data validity…