Sciweavers

82 search results - page 3 / 17
» Tight bounds for clock synchronization
Sort
View
FOCS
1993
IEEE
13 years 10 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
ALGORITHMICA
2007
132views more  ALGORITHMICA 2007»
13 years 5 months ago
On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks
We study the problem of providing a sensor with an accurate estimate of the time, from a novel perspective which is complementary to the well-studied clock synchronization problem....
Daniela Tulone
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 5 months ago
Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks
We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing syste...
Ariel Daliot, Danny Dolev, Hanna Parnas
PODC
2010
ACM
13 years 9 months ago
Optimal gradient clock synchronization in dynamic networks
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rote...
ISCAS
2005
IEEE
138views Hardware» more  ISCAS 2005»
13 years 11 months ago
Transition time bounded low-power clock tree construction
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
Min Pan, Chris C. N. Chu, J. Morris Chang