Time, clocks, and the ordering of events in a distributed system

Cites Work

Time, clocks, and the ordering of events in a distributed system

Cited In (only showing first 100 items - show all)

Applying relation algebra and RelView to solve problems on orders and lattices
Spanders: distributed spanning expanders
Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks
Time, clocks, and the ordering of events in a distributed system
\textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
Causal memory: definitions, implementation, and programming
Generalized Universality
The Two-Phase Commitment Protocol in an Extended π-Calculus
CELLULAR LEARNING AUTOMATA BASED DYNAMIC CHANNEL ASSIGNMENT ALGORITHMS
ROSCoq: Robots Powered by Constructive Reals
Replicated abstract data types: building blocks for collaborative applications
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Coalgebraic Semantic Model for the Clock Constraint Specification Language
Billiard quorums on the grid
Synchronous, asynchronous, and causally ordered communication
Symbolic predictive analysis for concurrent programs
\textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
Immediate detection of predicates in pervasive environments
From the happened-before relation to the causal ordered set abstraction
Info-based approach in distributed mutual exclusion algorithms
Approximating the buffer allocation problem using epochs
An optimistic checkpointing and message logging approach for consistent global checkpoint collection in distributed systems
Pronto: high availability for standard off-the-shelf databases
On termination detection in crash-prone distributed systems with failure detectors
On interprocess communication. I: Basic formalism
A limitation of vector timestamps for reconstructing distributed computations
On the time complexity of minimum and maximum global snapshot problems
Evaluations of domino-free communication-induced checkpointing protocols
Optimistic atomic broadcast: A pragmatic viewpoint
Computability and realizability for interactive computations
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
Concurrent abstract state machines
Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
Distributed algorithm to detect strong conjunctive predicates
How processes learn
On the diversity of asynchronous communication
A framework for viewing atomic events in distributed computations
Appraising fairness in languages for distributed programming
Distributed simulation of modular time Petri nets: An approach and a case study exploiting temporal uncertainty
The equational theory of pomsets
The causal ordering abstraction and a simple way to implement it
Interval consistency of asynchronous distributed computations
A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie
Consistent global checkpoints based on direct dependency tracking
Decompositions of positive self-dual Boolean functions
Low complexity Byzantine-resilient consensus
Minimum self-dual decompositions of positive dual-minor Boolean functions
A distributed solution of the distributed termination problem
Checkpointing with mutable checkpoints.
The entropy of a distributed computation random number generation from memory interleaving
A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology
Repeated detection of conjunctive predicates in distributed executions
A family of optimal termination detection algorithms
The overhead of consensus failure recovery
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
The space complexity of unbounded timestamps
Innovations in computational type theory using Nuprl
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
The quantum field as a quantum computer
Visualizing the runtime behavior of embedded network systems: A toolkit for TinyOS
Tree structure for distributive lattices and its applications
Relationships between memory models
A leader election algorithm for dynamic networks with causal clocks
Quantified epistemic logics for reasoning about knowledge in multi-agent systems
Data-stream-based global event monitoring using pairwise interactions
Sublinear bounds for randomized leader election
Distributed constraint satisfaction with partially known constraints
Min-domain retroactive ordering for asynchronous backtracking
Dynamic ordering for asynchronous backtracking on DisCSPs
Message delay and DisCSP search algorithms
A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION
Concerning the size of logical clocks in distributed systems
Semantics of Deterministic Shared-Memory Systems
\(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
A distributed mutual exclusion algorithm over multi-routing protocol for mobilead hocnetworks
Using adaptive timeouts to achieve at-most-once message delivery
X-Ability: a theory of replication
Global Reproducibility Through Local Control for Distributed Active Objects
Timed-pNets: a communication behavioural semantic model for distributed systems
A partial ordering semantics for CCS
Flush primitives for asynchronous distributed systems
Virtual time and virtual space
The poset of infinitary traces
Concurrent histories: a basis for observing distributed systems
Distributed deadlock detection
Hybrid concurrency control for abstract data types
Dissecting distributed coordination
Second-level algorithms, superrecursivity, and recovery problem in distributed systems
Monitoring distributed real-time systems
Asynchronous backtracking without adding links: a new member in the ABT family
Asynchronous aggregation and consistency in distributed constraint satisfaction
Lower bounds for asynchronous consensus
Techniques and applications of computation slicing
Logical classification of distributed algorithms (Bakery algorithms as an example)
The space complexity of long-lived and one-shot timestamp implementations
A denotational semantics for SPARC TSO
Unifying stabilization and termination in message-passing systems

This page was built for publication: Time, clocks, and the ordering of events in a distributed system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157944)