1434 search results - page 154 / 287 » Distributed Computing with Imperfect Randomness |
PODC
1999
ACM
15 years 4 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
134
click to vote
ICDCN
2011
Springer
14 years 3 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
104
click to vote
HPCC
2007
Springer
15 years 6 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
103
click to vote
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
ICDCS
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...