4045 search results - page 443 / 809 » Special Section on Parallel Distributed Computing and Networ... |
137
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
121
Voted
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
126
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topo...
161
click to vote
PDP
2005
IEEE
15 years 10 months ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
158
click to vote
HPCA
1998
IEEE
15 years 9 months ago
1998
IEEE
The goal of this paper is to gain insight into the relative performance of communication mechanisms as bisection bandwidth and network latency vary. We compare shared memory with ...