4045 search results - page 166 / 809 » Special Section on Parallel Distributed Computing and Networ... |
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
CCGRID
2004
IEEE
15 years 1 months ago
2004
IEEE
Highly popular websites can suffer classical congestion collapse because of the ability of outgoing `bursty' data to congest the server side link. Using the well known and re...
OPODIS
2010
14 years 8 months ago
2010
Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that conside...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...