3836 search results - page 292 / 768 » Dynamic Communicators in MPI |
194
click to vote
ISCA
2007
IEEE
16 years 1 months ago
2007
IEEE
The ability to perform long, accurate molecular dynamics (MD) simulations involving proteins and other biological macromolecules could in principle provide answers to some of the ...
208
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
215
click to vote
ICPP
2006
IEEE
16 years 1 months ago
2006
IEEE
— Resource discovery is the process of locating shared resources on a computer network. Previously studied examples include efficiently finding files with a given title on a ...
204
click to vote
IPPS
2005
IEEE
16 years 1 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
174
click to vote
IWCMC
2010
ACM
16 years 14 days ago
2010
ACM
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...