Sciweavers

1324 search results - page 178 / 265
» Backtracking-based load balancing
Sort
View
ANCS
2005
ACM
15 years 3 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
HIPC
2000
Springer
15 years 1 months ago
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
ICDCS
1991
IEEE
15 years 1 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
14 years 11 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
DAIS
2003
14 years 11 months ago
Rational Server Selection for Mobile Agents
- Mobile agents have the ability to migrate through heterogeneous networks and execute at remote hosts. This ability can be exploited to improve the performance of agent based appl...
Carsten Pils, Stefan Diepolder