2924 search results - page 340 / 585 » Lower Bounds in Distributed Computing |
133
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
111
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we first present a uniformity property that characterises optimal channel assignments for networks arranged as cellular or square grids. Then, we present optimal ch...
129
Voted
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
127
click to vote
HPCA
1995
IEEE
15 years 8 months ago
1995
IEEE
As processor speeds increase relative to memory speeds, memory bandwidth is rapidly becoming the limiting performance factor for many applications. Several approaches to bridging ...
163
Voted
PDCN
2004
15 years 6 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...