6437 search results - page 361 / 1288 » Parallel Algorithms for Arrangements |
118
click to vote
IPPS
1999
IEEE
15 years 8 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...
144
click to vote
ICDCS
1997
IEEE
15 years 8 months ago
1997
IEEE
—This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objec...
141
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
129
click to vote
ICPP
1992
IEEE
15 years 8 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
140
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...