174 search results - page 4 / 35 » Load balancing and locality in range-queriable data structur... |
CAL
2002
13 years 7 months ago
2002
Global communication costs in future single-chip multiprocessors will increase linearly with distance. In this paper, we revisit the issues of locality and load balance in order to...
COMCOM
2007
13 years 7 months ago
2007
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
SIAMSC
2011
12 years 10 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
GI
2004
Springer
14 years 29 days ago
2004
Springer
Abstract: Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalabl...