5448 search results - page 857 / 1090 » Breakpoints and Time in Distributed Computations |
149
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
205
click to vote
OPODIS
2010
15 years 4 months ago
2010
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
222
click to vote
ICDCN
2011
Springer
14 years 10 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 ...
200
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Logs are one of the most important pieces of analytical data in a cloud-based service infrastructure. At any point in time, service owners and operators need to understand the sta...
171
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...