197 search results - page 18 / 40 » Robust Parallel Computations through Randomization |
85
Voted
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
92
Voted
ICDCSW
2008
IEEE
15 years 4 months ago
2008
IEEE
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
ICDCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Peer-to-peer file sharing is popular, but it generates random write traffic to storage due to the nature of swarming. NAND flash memory based Solid-State Drive (SSD) technology...
PODS
2005
ACM
15 years 9 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
81
Voted
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...