Sciweavers

1929 search results - page 92 / 386
» Load Balancing with Memory
Sort
View
140
Voted
ICALP
2003
Springer
15 years 7 months ago
Convergence Time to Nash Equilibria
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
Eyal Even-Dar, Alexander Kesselman, Yishay Mansour
122
Voted
KIVS
2005
Springer
15 years 8 months ago
On the Distribution of Nodes in Distributed Hash Tables
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
Heiko Niedermayer, Simon Rieche, Klaus Wehrle, Geo...
124
Voted
TPDS
2002
85views more  TPDS 2002»
15 years 2 months ago
Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands
Li Xiao, Songqing Chen, Xiaodong Zhang
MICRO
1998
IEEE
92views Hardware» more  MICRO 1998»
15 years 6 months ago
Predictive Techniques for Aggressive Load Speculation
Load latency remains a significant bottleneck in dynamically scheduled pipelined processors. Load speculation techniques have been proposed to reduce this latency. Dependence Pred...
Glenn Reinman, Brad Calder
157
Voted
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
13 years 5 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray