On interprocess communication. II: Algorithms
From MaRDI portal
Recommendations
- On interprocess communication. I: Basic formalism
- Two Tools for Interprocess Communication in Distributed Data-Flow Systems
- An algorithm for analyzing communicating processes
- Communication in parallel systems : Models, algorithms and implementations
- scientific article; zbMATH DE number 425387
- The mutual exclusion problem
- The mutual exclusion problem. I: A theory of interprocess communication
Cites work
Cited in
(59)- Formalization of parallelism forms in IPCL
- Modelling mutual exclusion in a process algebra with time-outs
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+}
- Intermediate value linearizability: a quantitative correctness criterion
- Clock construction in fully asynchronous parallel systems and PRAM simulation
- Randomized registers and iterative algorithms
- Of concurrent data structures and iterations
- Randomized consensus with regular registers
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Dynamic regular registers in systems with churn
- Blocking versus nonblocking interprocess communication: A note on the effect on concurrency
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- Possible values: exploring a concept for concurrency
- Linear-time snapshot implementations in unbalanced systems
- Efficient test \& set constructions for faulty shared memory
- Nonatomic mutual exclusion with local spinning
- Integrated bounds for disintegrated storage
- Wait-free regular storage from Byzantine components
- Introduction à l'algorithmique des objets partagés
- Towards an understanding of unbounded variables in asynchronous systems
- Optimality of wait-free atomic multiwriter variables
- Simulation Refinement for Concurrency Verification
- Naming symmetric processes using shared variables
- Towards a practical snapshot algorithm
- The assignment problem
- Tight space bounds for \(\ell\)-exclusion
- Definability and decidability of binary predicates for time granularity
- The power of multiobjects.
- The difference between splitting in \(n\) and \(n+1\)
- Hundreds of impossibility results for distributed computing
- Randomized two-process wait-free test-and-set
- The behavior of shared objects: Concept, pitfalls, and a new model
- On interprocess communication. I: Basic formalism
- Concurrent use of write-once memory
- A case study in transformational design of concurrent systems
- Leader election in the presence of n-1 initial failures
- Time and space optimal implementations of atomic multi-writer register
- From adaptive renaming to set agreement
- Probabilistic quorum systems
- Synchronous Byzantine quorum systems
- The mailbox problem
- Linearizable read/write objects
- Atomic semantics of nonatomic programs
- On the use of registers in achieving wait-free consensus
- The entropy of a distributed computation random number generation from memory interleaving
- Converting Lamport's regular register to atomic register
- Global serializability of concurrent programs
- Self-stabilizing \(\ell\)-exclusion
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
- On self-stabilizing wait-free clock synchronization
- Invariants for the construction of a handshake register
- The time complexity of updating snapshot memories
- scientific article; zbMATH DE number 982545 (Why is no real title available?)
- Adaptive progress: a gracefully-degrading liveness property
- Linear space bootstrap communication schemes
- Relaxed data types as consistency conditions
- scientific article; zbMATH DE number 4080895 (Why is no real title available?)
- Relationships between memory models
- Step-optimal implementations of large single-writer registers
This page was built for publication: On interprocess communication. II: Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079946)
