28357 search results - page 309 / 5672 » Communications |
184
click to vote
PPOPP
1997
ACM
15 years 11 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
171
click to vote
HPCN
1997
Springer
15 years 11 months ago
1997
Springer
We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applic...
168
click to vote
HPCN
1994
Springer
15 years 10 months ago
1994
Springer
On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods 3]. We consider improved ...
170
click to vote
NGC
2000
Springer
15 years 10 months ago
2000
Springer
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
200
click to vote
ISCA
1995
IEEE
15 years 10 months ago
1995
IEEE
Communicationin aparallel systemfrequently involvesmoving data from the memory of one node to the memory of another; this is the standard communication model employedin message pa...