Pages that link to "Item:Q4157944"
From MaRDI portal
The following pages link to Time, clocks, and the ordering of events in a distributed system (Q4157944):
Displaying 50 items.
- Billiard quorums on the grid (Q287209) (← links)
- On the time complexity of minimum and maximum global snapshot problems (Q293343) (← links)
- A limitation of vector timestamps for reconstructing distributed computations (Q293417) (← links)
- Evaluations of domino-free communication-induced checkpointing protocols (Q294603) (← links)
- Concurrent abstract state machines (Q303691) (← links)
- On the diversity of asynchronous communication (Q315311) (← links)
- The space complexity of unbounded timestamps (Q352241) (← links)
- A leader election algorithm for dynamic networks with causal clocks (Q360270) (← links)
- Spanders: distributed spanning expanders (Q395654) (← links)
- Symbolic predictive analysis for concurrent programs (Q432146) (← links)
- Immediate detection of predicates in pervasive environments (Q433409) (← links)
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems (Q433441) (← links)
- Info-based approach in distributed mutual exclusion algorithms (Q433445) (← links)
- From the happened-before relation to the causal ordered set abstraction (Q433461) (← links)
- Pronto: high availability for standard off-the-shelf databases (Q436657) (← links)
- Data-stream-based global event monitoring using pairwise interactions (Q436782) (← links)
- On termination detection in crash-prone distributed systems with failure detectors (Q436803) (← links)
- Approximating the buffer allocation problem using epochs (Q436884) (← links)
- An optimistic checkpointing and message logging approach for consistent global checkpoint collection in distributed systems (Q436920) (← links)
- Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) (Q442277) (← links)
- A multi-cycle checkpointing protocol that ensures strict 1-rollback (Q456127) (← links)
- A hybrid distributed mutual exclusion algorithm for cluster-based systems (Q474004) (← links)
- Sublinear bounds for randomized leader election (Q477103) (← links)
- Logical classification of distributed algorithms (Bakery algorithms as an example) (Q541220) (← links)
- Simulating synchronous processors (Q578903) (← links)
- Data race avoidance and replay scheme for developing and debugging parallel programs on distributed shared memory systems (Q632716) (← links)
- Replicated abstract data types: building blocks for collaborative applications (Q635322) (← links)
- Parallel implementations of Brunotte's algorithm (Q635350) (← links)
- Efficient online algorithm for identifying useless states in distributed systems (Q658673) (← links)
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks (Q660994) (← links)
- On set consensus numbers (Q661057) (← links)
- Transactional memory (Q666225) (← links)
- On-the-fly analysis of distributed computations (Q673006) (← links)
- Virtual time and virtual space (Q685231) (← links)
- The poset of infinitary traces (Q689293) (← links)
- Second-level algorithms, superrecursivity, and recovery problem in distributed systems (Q692890) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- The asynchronous bounded-cycle model (Q719298) (← links)
- Self-stabilizing leader election in dynamic networks (Q722199) (← links)
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
- A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems (Q757018) (← links)
- Analysis of a clock synchronization protocol for wireless sensor networks (Q764293) (← links)
- A centralized and a decentralized method to automatically derive choreography-conforming web service systems (Q764383) (← links)
- \(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication (Q765495) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- Quantified epistemic logics for reasoning about knowledge in multi-agent systems (Q835839) (← links)
- Min-domain retroactive ordering for asynchronous backtracking (Q842785) (← links)
- Distributed constraint satisfaction with partially known constraints (Q842788) (← links)
- Dynamic ordering for asynchronous backtracking on DisCSPs (Q850468) (← links)
- Message delay and DisCSP search algorithms (Q862557) (← links)
