16 search results - page 1 / 4 » Balanced binary trees for ID management and load balance in ... |
PODC
2004
ACM
13 years 10 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
NBIS
2007
Springer
13 years 10 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
GI
2004
Springer
13 years 10 months 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...
ERLANG
2003
ACM
13 years 9 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
PDP
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...