Sciweavers

461 search results - page 6 / 93
» Dynamic Load Balancing in Distributed Hash Tables
Sort
View
IEEEPACT
2005
IEEE
14 years 1 months ago
Communication Optimizations for Fine-Grained UPC Applications
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
Wei-Yu Chen, Costin Iancu, Katherine A. Yelick
ANCS
2005
ACM
14 years 1 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
DOLAP
1998
ACM
13 years 12 months ago
Dynamic Maintenance of Multidimensional Range Data Partitioning for Parallel Data Processing
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
Junping Sun, William I. Grosky
IPPS
2008
IEEE
14 years 2 months ago
Random choices for churn resilient load balancing in peer-to-peer networks
Peer-to-peer (P2P) networks based on consistent hashing functions have an inherent load uneven distribution problem. Things are even worse in unstructured P2P systems. The objecti...
Song Fu, Cheng-Zhong Xu, Haiying Shen
FOCS
1999
IEEE
14 years 1 days ago
How Asymmetry Helps Load Balancing
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose
Berthold Vöcking