60 search results - page 4 / 12 » Optimal Communication Complexity of Generic Multicast Key Di... |
116
click to vote
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper develops simple cost models for provisioning content distribution networks that use the simple and highly scalable bandwidth skimming protocol for streaming. New insight...
102
click to vote
MIDDLEWARE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and ...
PDP
2010
IEEE
15 years 1 months ago
2010
IEEE
The increasing numbers of cores, shared caches and memory nodes within machines introduces a complex hardware topology. High-performance computing applications now have to carefull...
110
click to vote
PODC
2012
ACM
12 years 12 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
105
click to vote
ESAW
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Load-Balancing is a significant problem in heterogeneous distributed systems. There exist many load balancing algorithms, however, most approaches are very problem speci...