94 search results - page 16 / 19 » Tight Bounds for Parallel Randomized Load Balancing |
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
INFORMATICALT
2010
13 years 6 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
ICPP
2003
IEEE
14 years 1 months ago
2003
IEEE
Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
PODS
2004
ACM
14 years 8 months ago
2004
ACM
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...