Sciweavers

197 search results - page 9 / 40
» Robust Parallel Computations through Randomization
Sort
View
SKG
2006
IEEE
15 years 3 months ago
IAC: Interest-Aware Caching for Unstructured P2P
The simplicity and robustness of unstructured P2P system make it a preferable architecture for constructing real large scale file sharing system. Most of the existing paradigms re...
Xucheng Luo, Zhiguang Qin, Ji Geng, Jiaqing Luo
JACM
2006
98views more  JACM 2006»
14 years 9 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
EUROPAR
2009
Springer
15 years 25 days ago
Enabling High Data Throughput in Desktop Grids through Decentralized Data and Metadata Management: The BlobSeer Approach
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
PODC
1990
ACM
15 years 1 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
LCR
2000
Springer
172views System Software» more  LCR 2000»
15 years 1 months ago
Achieving Robust, Scalable Cluster I/O in Java
We present Tigris, a high-performance computation and I/O substrate for clusters of workstations that is implemented entirely in Java. Tigris automatically balances resource load a...
Matt Welsh, David E. Culler