Sciweavers

692 search results - page 9 / 139
» Balanced High Availability in Layered Distributed Computing ...
Sort
View
PODC
2004
ACM
14 years 1 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
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...
Gurmeet Singh Manku
WSC
2008
13 years 10 months ago
A flexible and scalable experimentation layer
Modeling and simulation frameworks for use in different application domains, throughout the complete development process, and in different hardware environments need to be highly ...
Jan Himmelspach, Roland Ewald, Adelinde M. Uhrmach...
AP2PC
2005
Springer
14 years 1 months ago
Highly Available DHTs: Keeping Data Consistency After Updates
Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availabili...
Predrag Knezevic, Andreas Wombacher, Thomas Risse
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 1 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
HPDC
2005
IEEE
14 years 1 months ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...