2924 search results - page 156 / 585 » Lower Bounds in Distributed Computing |
100
click to vote
ICDCS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
101
click to vote
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
The growing reliance on services provided by software applications places a high premium on the reliable and efficient operation of these applications. A number of these applicat...
124
click to vote
PODC
2003
ACM
15 years 6 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
104
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
In this paper we present sorting algorithms on the recently introduced N2 processor OTIS-Mesh, a network with diameter 4 p N , 3 consisting of N connected meshes of size p N p N...
115
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...