1600 search results - page 89 / 320 » Clustering for opportunistic communication |
164
click to vote
PVM
2005
Springer
15 years 11 months ago
2005
Springer
MPI defines one-sided communication operations—put, get, and accumulate—together with three different synchronization mechanisms that define the semantics associated with th...
164
click to vote
CCGRID
2008
IEEE
16 years 20 days ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
189
click to vote
WCNC
2008
IEEE
16 years 17 days ago
2008
IEEE
— In this paper, we design and investigate a novel Interleave Division Multiplexing based Space-Time Code (IDM-STC) in the context of cooperative communications. We outline the p...
153
Voted
CONCURRENCY
2007
15 years 6 months ago
2007
We discuss the design and high-performance implementation of collective communications operations on distributed-memory computer architectures. Using a combination of known techni...
164
click to vote
PPL
2002
15 years 5 months ago
2002
We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. Thes...