Sciweavers

197 search results - page 18 / 40
» Robust Parallel Computations through Randomization
Sort
View
SPAA
2009
ACM
15 years 6 months ago
A randomized, o(log w)-depth 2 smoothing network
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...
Marios Mavronicolas, Thomas Sauerwald
92
Voted
ICDCSW
2008
IEEE
15 years 4 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—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 ...
Yin Chen, Li Tang, Jun Li
ICDCS
2009
IEEE
15 years 6 months ago
FlashLite: A User-Level Library to Enhance Durability of SSD for P2P File Sharing
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...
Hyojun Kim, Umakishore Ramachandran
PODS
2005
ACM
164views Database» more  PODS 2005»
15 years 9 months ago
Lower bounds for sorting with few random accesses to external memory
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...
Martin Grohe, Nicole Schweikardt
81
Voted
EUROPAR
2009
Springer
15 years 4 months ago
Adaptive Peer Sampling with Newscast
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, ...
Norbert Tölgyesi, Márk Jelasity