6542 search results - page 357 / 1309 » The tao of parallelism in algorithms |
167
click to vote
COCOON
2000
Springer
15 years 11 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
161
click to vote
IPPS
1999
IEEE
15 years 11 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...
195
click to vote
ICDCS
1997
IEEE
15 years 11 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...
177
click to vote
IPPS
1997
IEEE
15 years 11 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. ...
168
click to vote
ICPP
1992
IEEE
15 years 11 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...