2084 search results - page 155 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
128
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
140
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...
150
Voted
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
171
Voted
DIALM
2005
ACM
15 years 7 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
145
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...