On interprocess communication. II: Algorithms
From MaRDI portal
Publication:1079946
DOI10.1007/BF01786228zbMath0598.68023OpenAlexW1976075610MaRDI QIDQ1079946
Publication date: 1986
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01786228
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25) Distributed algorithms (68W15)
Related Items (53)
On interprocess communication. I: Basic formalism ⋮ Clock construction in fully asynchronous parallel systems and PRAM simulation ⋮ Efficient test \& set constructions for faulty shared memory ⋮ A case study in transformational design of concurrent systems ⋮ The time complexity of updating snapshot memories ⋮ Invariants for the construction of a handshake register ⋮ Possible values: exploring a concept for concurrency ⋮ Byzantine disk paxos: optimal resilience with Byzantine shared memory ⋮ On self-stabilizing wait-free clock synchronization ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Wait-free regular storage from Byzantine components ⋮ Of Concurrent Data Structures and Iterations ⋮ Relationships between memory models ⋮ Atomic semantics of nonatomic programs ⋮ The entropy of a distributed computation random number generation from memory interleaving ⋮ Converting Lamport's regular register to atomic register ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ The behavior of shared objects: Concept, pitfalls, and a new model ⋮ Step-optimal implementations of large single-writer registers ⋮ Dynamic regular registers in systems with churn ⋮ Linear-time snapshot implementations in unbalanced systems ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Randomized registers and iterative algorithms ⋮ Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks ⋮ Nonatomic mutual exclusion with local spinning ⋮ Introduction à l'algorithmique des objets partagés ⋮ Naming symmetric processes using shared variables ⋮ On the use of registers in achieving wait-free consensus ⋮ Synchronous Byzantine quorum systems ⋮ Randomized two-process wait-free test-and-set ⋮ Hundreds of impossibility results for distributed computing ⋮ Linear space bootstrap communication schemes ⋮ The mailbox problem ⋮ The assignment problem ⋮ Simulation Refinement for Concurrency Verification ⋮ Towards an understanding of unbounded variables in asynchronous systems ⋮ Optimality of wait-free atomic multiwriter variables ⋮ Tight space bounds for \(\ell\)-exclusion ⋮ Time and space optimal implementations of atomic multi-writer register ⋮ Definability and decidability of binary predicates for time granularity ⋮ Unnamed Item ⋮ Adaptive progress: a gracefully-degrading liveness property ⋮ Towards a practical snapshot algorithm ⋮ Self-stabilizing \(\ell\)-exclusion ⋮ Relaxed data types as consistency conditions ⋮ From adaptive renaming to set agreement ⋮ Randomized consensus with regular registers ⋮ Leader election in the presence of n-1 initial failures ⋮ Concurrent Use of Write-Once Memory ⋮ Linearizable read/write objects ⋮ The power of multiobjects. ⋮ Probabilistic quorum systems ⋮ Global serializability of concurrent programs
Cites Work
This page was built for publication: On interprocess communication. II: Algorithms
