1391 search results - page 80 / 279 » Distributed routing in networks using affinity propagation |
145
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
134
click to vote
EUROPAR
2001
Springer
15 years 10 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
176
click to vote
ICPADS
2002
IEEE
15 years 11 months ago
2002
IEEE
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
193
click to vote
ICS
2009
Tsinghua U.
15 years 11 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
177
click to vote
MSWIM
2004
ACM
15 years 11 months ago
2004
ACM
All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. Although it is tempting to assume that a...