2084 search results - page 376 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
105
click to vote
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
ASIAN
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
JCB
2006
14 years 9 months ago
2006
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
66
Voted
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
Buffered crossbar switches are a special type of combined input-output queued switches with each crosspoint of the crossbar having small on-chip buffers. The introduction of cross...