Sciweavers

82 search results - page 9 / 17
» Tight bounds for clock synchronization
Sort
View
SPIN
2000
Springer
13 years 11 months ago
Modeling the ASCB-D Synchronization Algorithm with SPIN: A Case Study
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
Nicholas Weininger, Darren D. Cofer
WDAG
2004
Springer
113views Algorithms» more  WDAG 2004»
14 years 1 months ago
Bounded Version Vectors
Abstract. Version vectors play a central role in update tracking under optimistic distributed systems, allowing the detection of obsolete or inconsistent versions of replicated dat...
José Bacelar Almeida, Paulo Sérgio A...
EDCC
2005
Springer
14 years 1 months ago
Failure Detection with Booting in Partially Synchronous Systems
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failu...
Josef Widder, Gérard Le Lann, Ulrich Schmid
WDAG
1998
Springer
87views Algorithms» more  WDAG 1998»
13 years 12 months ago
Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems
d Abstract) James H. Anderson, Rohit Jain, and David Ott Department of Computer Science University of North Carolina at Chapel Hill We consider wait-free synchronization in multipr...
James H. Anderson, Rohit Jain, David Ott
GLOBECOM
2007
IEEE
14 years 2 months ago
A Geometric Approach to Slot Alignment in Wireless Sensor Networks
— Traditionally, slotted communication protocols have employed guard times to delineate and align slots. These guard times may expand the slot duration significantly, especially...
Niky Riga, Ibrahim Matta, Azer Bestavros