316 search results - page 8 / 64 » On the Space Complexity of Randomized Synchronization |
162
Voted
HASE
1997
IEEE
15 years 8 months ago
1997
IEEE
: The most important aspect of concurrent and distributed computation is the interaction between system components. Integration of components into a system requires some synchroniz...
131
click to vote
TMC
2008
15 years 3 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
127
click to vote
IISWC
2008
IEEE
15 years 10 months ago
2008
IEEE
The design and evaluation of microprocessor architectures is a difficult and time-consuming task. Although small, handcoded microbenchmarks can be used to accelerate performance e...
120
click to vote
SAMOS
2007
Springer
15 years 10 months ago
2007
Springer
As multi-processor system-on-chip (MPSoC) has become an effective solution to ever-increasing design complexity of modern embedded systems, fast and accurate HW/SW cosimulation of...
130
click to vote
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...