1434 search results - page 29 / 287 » Distributed Computing with Imperfect Randomness |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
WCE
2007
13 years 8 months ago
2007
— This paper presents an important outcome of a research programme which focuses on the development of a method for synthesizing, under controlled conditions in the laboratory, t...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Abstract. The inherently sequential nature of random discrete eventdriven simulation has made parallel and distributed processing di cult. This paper presents a method of applying ...
SPAA
2010
ACM
14 years 11 days ago
2010
ACM
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...