16159 search results - page 2742 / 3232 » Parallel computing with CUDA |
226
click to vote
PODC
2006
ACM
16 years 25 days ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
190
click to vote
PPOPP
2006
ACM
16 years 25 days ago
2006
ACM
Recently there has been renewed interest in building reliable servers that support continuous application operation. Besides maintaining system state consistent after a failure, o...
184
click to vote
SPAA
2006
ACM
16 years 25 days ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
171
click to vote
SPAA
2006
ACM
16 years 25 days ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
127
click to vote
SPAA
2006
ACM
16 years 25 days ago
2006
ACM
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we st...