Sciweavers

2 search results - page 1 / 1
» Collective asynchronous reading with polylogarithmic worst-c...
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 4 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
PODC
2010
ACM
13 years 6 months ago
Distributed data classification in sensor networks
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
Ittay Eyal, Idit Keidar, Raphael Rom