3265 search results - page 430 / 653 » Distributed Slicing in Dynamic Systems |
133
Voted
IJNSEC
2008
15 years 4 months ago
2008
Current anonymous systems either use a small, fixed core set of mixes or randomly choose a sequence of peer nodes to form anonymous paths/tunnels. The resulting paths are fragile ...
124
click to vote
PE
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we study the problem of dynamic allocation of the resources of a general parallel processing system, comprised of M heterogeneous processors and M heterogeneous tra...
171
click to vote
PODC
2009
ACM
16 years 4 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...
134
click to vote
HPDC
2007
IEEE
15 years 8 months ago
2007
IEEE
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
157
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...