Time, clocks, and the ordering of events in a distributed system
From MaRDI portal
Publication:4157944
DOI10.1145/359545.359563zbMath0378.68027WikidataQ54248927 ScholiaQ54248927MaRDI QIDQ4157944
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359545.359563
Related Items
Introduction à l'algorithmique des objets partagés, Calculs approchés de la borne inférieure de valeurs réparties, Adaptive checkpointing in message passing distributed systems, On-line computations of the ideal lattice of posets, On-the-fly analysis of distributed computations, Virtual time and virtual space, The poset of infinitary traces, \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion, A framework for viewing atomic events in distributed computations, Clock synchronization and the power of broadcasting, Hybrid concurrency control for abstract data types, Concerning the size of logical clocks in distributed systems, The causal ordering abstraction and a simple way to implement it, A network model of Barrier synchronization algorithms, Formal timing analysis of distributed systems, A class of systems with nearly zero distributed simulation overhead, Efficient distributed simulation of acyclic systems, An efficient implementation of vector clocks, A note of Raymond's tree based algorithm for distributed mutual exclusion, Concurrent common knowledge: Defining agreement for asynchronous systems, On equivalence-completions of fairness assumptions, Recording distributed snapshots based on causal order of message delivery, Low-cost clock synchronization, Wait-free implementations in message-passing systems, Knowledge in shared memory systems., A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie, An assertional proof of Rana's algorithm, Distributed algorithms for multiple entries to a critical section with priority, Consistent global checkpoints based on direct dependency tracking, Monitoring distributed real-time systems, A compositional framework for fault tolerance by specification transformation, An optimal algorithm for distributed snapshots with causal message ordering, Detecting causal relationships in distributed computations: In search of the holy grail, Computing on-line the lattice of maximal antichains of posets, Scheduling problems in parallel systems for telecommunications, Tree structure for distributive lattices and its applications, Shared global states in distributed computations, A temporal logic for real-time partial ordering with named transactions, On-line algorithms for orders, Efficient algorithms for checking the atomicity of a run of read and write operations, Decompositions of positive self-dual Boolean functions, Minimum self-dual decompositions of positive dual-minor Boolean functions, Garbage collection in uncoordinated checkpointing algorithms
