4045 search results - page 166 / 809 » Special Section on Parallel Distributed Computing and Networ... |
140
click to vote
PODC
2004
ACM
15 years 11 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...
137
click to vote
CCGRID
2004
IEEE
15 years 9 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...
167
click to vote
OPODIS
2010
15 years 4 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...
164
click to vote
IPPS
2009
IEEE
16 years 21 days 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...
123
click to vote
IPPS
2000
IEEE
15 years 10 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 ...