1520 search results - page 28 / 304 » The Ring Loading Problem |
PODC
1999
ACM
15 years 2 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
IJHPCA
2006
14 years 10 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
159
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU's makes it possible to process more data at highe...
ICPP
2005
IEEE
15 years 3 months ago
2005
IEEE
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...