Sciweavers

292 search results - page 11 / 59
» Computing Replica Placement in Distributed Systems
Sort
View
90
Voted
NSDI
2004
15 years 29 days ago
Consistent and Automatic Replica Regeneration
Reducing management costs and improving the availability of large-scale distributed systems require automatic replica regeneration, i.e., creating new replicas in response to repl...
Haifeng Yu, Amin Vahdat
TPDS
2010
107views more  TPDS 2010»
14 years 10 months ago
Optimal Resource Placement in Structured Peer-to-Peer Networks
—Utilizing the skewed popularity distribution in P2P systems, common in Gnutella and KazaA like P2P applications, we propose an optimal resource (replica or link) placement strat...
Weixiong Rao, Lei Chen 0002, Ada Wai-Chee Fu, Guor...
HPDC
2002
IEEE
15 years 4 months ago
A Decentralized, Adaptive Replica Location Mechanism
We describe a decentralized, adaptive mechanism for replica location in wide-area distributed systems. Unlike traditional, hierarchical (e.g, DNS) and more recent (e.g., CAN, Chor...
Matei Ripeanu, Ian T. Foster
IPPS
1996
IEEE
15 years 3 months ago
An Adaptive Approach to Data Placement
Programming distributed-memory machines requires careful placement of datato balance the computationalload among the nodes and minimize excess data movement between the nodes. Mos...
David K. Lowenthal, Gregory R. Andrews
INFOCOM
2006
IEEE
15 years 5 months ago
Proportional Replication in Peer-to-Peer Networks
— We recently showed for peer-to-peer networks, that having the number of replicas of each object proportional to the request rate for these objects has many per-node advantages....
Saurabh Tewari, Leonard Kleinrock