Time, clocks, and the ordering of events in a distributed system
From MaRDI portal
Publication:4157944
DOI10.1145/359545.359563zbMath0378.68027OpenAlexW3137220996WikidataQ54248927 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 (only showing first 100 items - show all)
Monotonic Prefix Consistency in Distributed Systems ⋮ Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Consensus in Data Management: From Distributed Commit to Blockchain ⋮ Global Reproducibility Through Local Control for Distributed Active Objects ⋮ Reachability analysis on distributed executions ⋮ Convolution and concurrency ⋮ Efficient Communication Induced Checkpointing Protocol for Broadcast Network-based Distributed Systems ⋮ Scalable Sender-Based Message Logging Protocol with Little Communication Overhead for Distributed Systems ⋮ Unnamed Item ⋮ Measure of parallelism of distributed computations ⋮ A temporal logic for real-time partial-ordering with named transactions ⋮ Causal behaviours and nets ⋮ Measuring concurrency of regular distributed computations ⋮ Interval approximations of message causality in distributed executions ⋮ On-line computations of the ideal lattice of posets ⋮ Decentralized runtime verification of message sequences in message-based systems ⋮ Be aware of your leaders ⋮ Sound concurrent traces for online monitoring ⋮ Dissecting distributed coordination ⋮ Total ordering algorithms for asynchronous Byzantine systems ⋮ Faster possibility detection by combining two approaches ⋮ A puzzle‐based material handling system for order picking ⋮ Completeness of a functional system for surjective functions ⋮ On specifications and proofs of timed circuits ⋮ Analysing parallel complexity of term rewriting ⋮ On the preservation of properties when changing communication models ⋮ Permissionless clock synchronization with public setup ⋮ Contextuality in distributed systems ⋮ About informatics, distributed computing, and our job: a personal view ⋮ Causal-consistent replay debugging for message passing programs ⋮ Reversible debugging of concurrent Erlang programs: supporting imperative primitives ⋮ Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability ⋮ Efficient Bounded Timestamping from Standard Synchronization Primitives ⋮ Unnamed Item ⋮ Transparent fault tolerance for scalable functional computation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Naming symmetric processes using shared variables ⋮ Efficient detection of a class of stable properties ⋮ Strong stable properties in distributed systems ⋮ Efficient algorithms for optimistic crash recovery ⋮ A class of high performance Maekawa-type algorithms for distributed systems under heavy demand ⋮ Causal memory: definitions, implementation, and programming ⋮ On deadlocks of exclusive AND-requests for resources ⋮ Using adaptive timeouts to achieve at-most-once message delivery ⋮ Synchronous, asynchronous, and causally ordered communication ⋮ The inhibition spectrum and the achievement of causal consistency ⋮ Necessary and sufficient conditions on information for causal message ordering and their optimal implementation ⋮ Communication-based prevention of useless checkpoints in distributed computations ⋮ X-Ability: a theory of replication ⋮ Causality tracking in causal message-logging protocols ⋮ The congenial talking philosophers problem in computer networks ⋮ Appraising two decades of distributed computing theory research ⋮ Finding missing synchronization in a distributed computation using controlled re-execution ⋮ The power of logical clock abstractions ⋮ Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks ⋮ Robustness Against Transactional Causal Consistency. ⋮ Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences ⋮ Forward-Reverse Observational Equivalences in CCSK ⋮ The Two-Phase Commitment Protocol in an Extended π-Calculus ⋮ Symmetric and Asymmetric Asynchronous Interaction ⋮ On the no-Z-cycle property in distributed executions ⋮ What Can be Computed in a Distributed System? ⋮ Genuine atomic multicast in asynchronous distributed systems ⋮ Compositionality: Ontology and Mereology of Domains ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Levels of knowledge in distributed systems. ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks ⋮ Detection of Disjunctive Normal Form Predicate in Distributed Systems ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Handling Parameterized Systems with Non-atomic Global Conditions ⋮ Self-stabilizing Virtual Synchrony ⋮ Wait-freedom with advice ⋮ Static Analysis Via Abstract Interpretation of the Happens-Before Memory Model ⋮ Unnamed Item ⋮ Unnamed Item ⋮ ENFORCING CONCURRENT TEMPORAL BEHAVIORS ⋮ Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs ⋮ GUARANTEED MUTUALLY CONSISTENT CHECKPOINTING IN DISTRIBUTED COMPUTATIONS ⋮ Monotonic Abstraction in Action ⋮ Distributed algorithms for multiple entries to a critical section with priority ⋮ Consistent global checkpoints based on direct dependency tracking ⋮ Strong eventual consistency of the collaborative editing framework WOOT ⋮ 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 ⋮ Abstractions for fault-tolerant global computing ⋮ A denotational semantics for SPARC TSO ⋮ \((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem ⋮ Reasoning about layered message passing systems ⋮ A visit to mutual exclusion in seven dates ⋮ Timed-pNets: a communication behavioural semantic model for distributed systems ⋮ Computing on-line the lattice of maximal antichains of posets ⋮ Limiting behavior of 3-color excitable media on arbitrary graphs ⋮ Clairvoyant state machine replication
Cites Work
This page was built for publication: Time, clocks, and the ordering of events in a distributed system
