Gradient clock synchronization in dynamic networks
From MaRDI portal
Publication:693764
DOI10.1007/S00224-011-9348-1zbMATH Open1253.68060OpenAlexW2039856994MaRDI QIDQ693764FDOQ693764
Authors: Fabian Kuhn, Thomas Locher, Rotem Oshman 
Publication date: 10 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/45549
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Closed form bounds for clock synchronization under simple uncertainty assumptions
- On the possibility and impossibility of achieving clock synchronization
- A theory of clock synchronization (extended abstract)
- Optimal and efficient clock synchronization under drifting clocks
- Optimal Clock Synchronization under Different Delay Assumptions
- Optimal gradient clock synchronization in dynamic networks
- Synchronizing clocks in the presence of faults
- The theory of timed I/O automata
- Gradient clock synchronization
- Oblivious Gradient Clock Synchronization
- An upper and lower bound for clock synchronization
- Dynamic fault-tolerant clock synchronization
- Tight bounds for clock synchronization
- Principles of Distributed Systems
Cited In (42)
- Resilience of mutual exclusion algorithms to transient memory faults
- Network Clock Synchronization Based on the Second-Order Linear Consensus Algorithm
- Byzantine agreement with homonyms
- Adaptively secure broadcast, revisited
- Clock synchronization and estimation in highly dynamic networks: an information theoretic approach
- Distributed deterministic edge coloring using bounded neighborhood independence
- Compact policy routing
- Coordinated consensus in dynamic networks
- The space complexity of long-lived and one-shot timestamp implementations
- MIS on trees
- Distributed graph coloring in a few rounds
- Time-efficient randomized multiple-message broadcast in radio networks
- From bounded to unbounded concurrency objects and back
- Xheal, localized self-healing using expanders
- Gradient clock synchronization
- Toward more localized local algorithms, removing assumptions concerning global knowledge
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Locally checkable proofs
- Optimal-time adaptive strong renaming, with applications to counting
- Analyzing consistency properties for fun and profit
- Stability of a peer-to-peer communication system
- The impact of memory models on software reliability in multiprocessors
- A tight unconditional lower bound on distributed randomwalk computation
- Scalable rational secret sharing
- Gradient clock synchronization
- Structuring unreliable radio networks
- Error-free multi-valued consensus with Byzantine failures
- Minimum congestion mapping in a cloud
- Conflict on a communication channel
- The round complexity of distributed sorting, extended abstract
- Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
- Dynamic ad hoc clock synchronization
- Oblivious Gradient Clock Synchronization
- Optimal gradient clock synchronization in dynamic networks
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
- Order optimal information spreading using algebraic gossip
- Fast and compact self stabilizing verification, computation, and fault detection of an MST
- A complexity separation between the cache-coherent and distributed shared memory models
- The complexity of robust atomic storage
- Fault-tolerant spanners
- Faster information dissemination in dynamic networks via network coding
- Tight bounds on information dissemination in sparse mobile networks
This page was built for publication: Gradient clock synchronization in dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693764)
