Sciweavers

461 search results - page 45 / 93
» Dynamic Load Balancing in Distributed Hash Tables
Sort
View
ICPADS
2005
IEEE
15 years 8 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
CN
1999
70views more  CN 1999»
15 years 2 months ago
Distributed Cooperative Web Servers
Traditional techniques for a distributed web server design rely on manipulation of central resources, such as routers or DNS services, to distribute requests designated for a sing...
Scott M. Baker, Bongki Moon
129
Voted
ICS
2009
Tsinghua U.
15 years 7 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
MOBILITY
2009
ACM
15 years 9 months ago
Feasibility evaluation of a communication-oriented P2P system in mobile environments
We present the feasibility evaluation of a structured communication-oriented Peer-to-Peer (P2P) system being used in mobile environments in this paper. The different levels of chu...
Zhonghong Ou, Erkki Harjula, Otso Kassinen, Mika Y...
110
Voted
SPAA
2003
ACM
15 years 7 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu