2924 search results - page 557 / 585 » Lower Bounds in Distributed Computing |
212
Voted
ICDCS
2005
IEEE
16 years 12 days ago
2005
IEEE
We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossipbased protocol using adaptive fanout. We model three versions of go...
183
Voted
SPAA
2005
ACM
16 years 11 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...
161
click to vote
SPAA
2004
ACM
16 years 7 days ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
194
click to vote
SPAA
2004
ACM
16 years 7 days ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
181
click to vote
SPAA
2003
ACM
16 years 1 days ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...