On interprocess communication. I: Basic formalism
From MaRDI portal
Publication:1079945
DOI10.1007/BF01786227zbMath0598.68022DBLPjournals/dc/Lamport86WikidataQ56066157 ScholiaQ56066157MaRDI QIDQ1079945
Publication date: 1986
Published in: Distributed Computing (Search for Journal in Brave)
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Related Items (89)
On atomic registers and randomized consensus in m\&m systems ⋮ Event-based proof of the mutual exclusion property of Peterson's algorithm ⋮ On the mutual-exclusion problem -- a quest for minimal solutions ⋮ On interprocess communication. II: Algorithms ⋮ Clock construction in fully asynchronous parallel systems and PRAM simulation ⋮ Composite registers ⋮ Mutual exclusion as a matter of priority ⋮ Self-stabilizing timestamps ⋮ Improved time bounds for linearizable implementations of abstract data types ⋮ The time complexity of updating snapshot memories ⋮ A visit to mutual exclusion in seven dates ⋮ Concurrent abstract state machines ⋮ Optimal propagation-based protocols implementing causal memories ⋮ The \(k\)-simultaneous consensus problem ⋮ Implementing dataflow with threads ⋮ Efficient algorithms for checking the atomicity of a run of read and write operations ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Unnamed Item ⋮ Simple atomic snapshots: A linear complexity solution with unbounded time-stamps ⋮ Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority ⋮ Interleaving set temporal logic ⋮ Distributed universality ⋮ Simple extensions of 1-writer atomic variable constructions to multiwriter ones ⋮ Languages of higher-dimensional automata ⋮ Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems ⋮ The topology of distributed adversaries ⋮ A Simple Object that Spans the Whole Consensus Hierarchy ⋮ Timing and causality in process algebra ⋮ A framework for viewing atomic events in distributed computations ⋮ Store-collect in the presence of continuous churn with application to snapshots and lattice agreement ⋮ Power and limits of distributed computing shared memory models ⋮ How a rainbow coloring function can simulate wait-free handshaking ⋮ Generating Posets Beyond N ⋮ Linear-time snapshot implementations in unbalanced systems ⋮ Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register ⋮ Wait-free computing ⋮ A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ Making Linearizability Compositional for Partially Ordered Executions ⋮ Leader-based de-anonymization of an anonymous read/write memory ⋮ Reasoning about causality between distributed nonatomic events ⋮ From the happened-before relation to the causal ordered set abstraction ⋮ Data-stream-based global event monitoring using pairwise interactions ⋮ Randomized registers and iterative algorithms ⋮ GeoQuorums: implementing atomic memory in mobile ad hoc networks ⋮ Concurrent reading while writing revisited ⋮ Introduction à l'algorithmique des objets partagés ⋮ Time-efficient read/write register in crash-prone asynchronous message-passing systems ⋮ Optimistic Erasure-Coded Distributed Storage ⋮ On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory ⋮ Causal memory: definitions, implementation, and programming ⋮ Self-stabilization of wait-free shared memory objects ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects ⋮ Computing $k$-Atomicity in Polynomial Time ⋮ On interprocess communication and the implementation of multi-writer atomic registers ⋮ Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers ⋮ A criterion for atomicity ⋮ Defining conditional independence using collapses ⋮ A coded shared atomic memory algorithm for message passing architectures ⋮ The computability of relaxed data structures: queues and stacks as examples ⋮ Structure of concurrency ⋮ Bisimulation and action refinement ⋮ Tight space bounds for \(\ell\)-exclusion ⋮ What Can be Computed in a Distributed System? ⋮ Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations ⋮ Logical classification of distributed algorithms (Bakery algorithms as an example) ⋮ Time and space optimal implementations of atomic multi-writer register ⋮ Unnamed Item ⋮ Weak atomicity: A helpful notion in the construction of atomic shared variables ⋮ Adaptive progress: a gracefully-degrading liveness property ⋮ Refined quorum systems ⋮ Finite-state concurrent programs can be expressed in pairwise normal form ⋮ Correctness and concurrent complexity of the black-white bakery algorithm ⋮ A queue based mutual exclusion algorithm ⋮ Modelling knowledge and action in distributed systems ⋮ Distributed algorithm to detect strong conjunctive predicates ⋮ A very simple construction of 1-writer multireader multivalued atomic variable ⋮ Mutual exclusion in fully anonymous shared memory systems ⋮ Tight Space Bounds for ℓ-Exclusion ⋮ Nonatomic dual bakery algorithm with bounded tokens ⋮ Concurrent Use of Write-Once Memory ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ Regular Register: An Implementation in a Churn Prone Environment ⋮ A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition ⋮ Contention-related crash failures: definitions, agreement algorithms, and impossibility results ⋮ Election in fully anonymous shared memory systems: tight space bounds and algorithms ⋮ Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps ⋮ A fine-grained solution to the mutual exclusion problem ⋮ Two-process synchronization
Cites Work
This page was built for publication: On interprocess communication. I: Basic formalism
