Safe semantics

Known as: Safe register 
Safe semantics is a consistency model that describes one type of guarantee a data register provides when it is shared by several processors in a… Expand
Wikipedia

Related topics

Related topics

8 relations
Atomic semanticsCentral processing unitConsistency modelParallel computing
Expand

Broader (1)

Concurrency control

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
Abstract This paper addresses for the first time the problem of MWMR atomic memory in a Mobile Byzantine Agents model. The… Expand
Is this relevant?
2015
2015
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority
A new approach to the study and analysis of Mutual Exclusion ME algorithms is presented, based on identifying the priority… Expand
Is this relevant?
2013
2013
Safe, Regular, and Atomic Read/Write Registers
For self-containment, this chapter starts with a short presentation of the notions of safe, regular, and atomic read/write… Expand
Is this relevant?
2007
2007
SWI-Prolog and the web
Where Prolog is commonly seen as a component in a Web application that is either embedded or communicates using a proprietary… Expand
  • figure 1
  • figure 4
  • figure 6
  • figure 7
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus protocol that uses a collection of n > 3t disks, t of… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Minimal Byzantine Storage
Byzantine fault-tolerant storage systems can provide high availability in hazardous environments, but the redundant servers they… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2000
2000
Competing in computing (poster session)
Several constructions implement more powerful registers from weaker ones. Their correctness proofs should be accessible to… Expand
Is this relevant?
1994
1994
How a Rainbow Coloring Function Can Simulate Wait-Free Handshaking
How to construct shared data objects is a fundamental issue in asynchronous concurrent systems, since these objects provide the… Expand
Is this relevant?
1990
1990
Bounds on the Costs of Register Implementations
A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication… Expand
Is this relevant?
1989
1989
Leader Election in the Presence of n-1 Initial Failures
We present a deterministic leader election protocol that can tolerate up to n−1 undetectable initial failures, where n is the… Expand
Is this relevant?