5005 search results - page 653 / 1001 » The Design and Analysis of Parallel Algorithms |
221
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
215
click to vote
PODC
2006
ACM
16 years 21 days ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
180
click to vote
SPAA
2005
ACM
16 years 9 days ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
177
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
193
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...