101 search results - page 17 / 21 » Simple Efficient Load Balancing Algorithms for Peer-to-Peer ... |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In highly interactive dynamic web database systems, user satisfaction determines their success. In such systems, userrequested web pages are dynamically created by executing a numb...
ICALP
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
SIGMETRICS
2010
ACM
13 years 7 months ago
2010
ACM
Modern storage systems use thousands of inexpensive disks to meet the storage requirement of applications. To enhance the data availability, some form of redundancy is used. For e...
ASPLOS
1992
ACM
13 years 11 months ago
1992
ACM
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...