1515 search results - page 182 / 303 » Parallel computing on any desktop |
160
Voted
SPAA
2004
ACM
15 years 9 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...
167
Voted
VECPAR
2004
Springer
15 years 9 months ago
2004
Springer
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...
135
click to vote
ICPP
2003
IEEE
15 years 9 months ago
2003
IEEE
Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clien...
123
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoret...
127
Voted
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...