Sciweavers

323 search results - page 63 / 65
» Range-capable Distributed Hash Tables
Sort
View
USITS
2003
13 years 8 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
CN
2008
100views more  CN 2008»
13 years 7 months ago
Building resilient low-diameter peer-to-peer topologies
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
Rita H. Wouhaybi, Andrew T. Campbell
CCR
2007
119views more  CCR 2007»
13 years 7 months ago
Exploiting KAD: possible uses and misuses
Peer-to-peer systems have seen a tremendous growth in the last few years and peer-to-peer traffic makes a major fraction of the total traffic seen in the Internet. The dominating ...
Moritz Steiner, Taoufik En-Najjary, Ernst W. Biers...
JPDC
2006
133views more  JPDC 2006»
13 years 7 months ago
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing fe...
Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Gr...
HPCA
2009
IEEE
14 years 8 months ago
Practical off-chip meta-data for temporal memory streaming
Prior research demonstrates that temporal memory streaming and related address-correlating prefetchers improve performance of commercial server workloads though increased memory l...
Thomas F. Wenisch, Michael Ferdman, Anastasia Aila...