1600 search results - page 269 / 320 » Clustering for opportunistic communication |
ESA
2005
Springer
14 years 4 months ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
HPCC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. As grid sizes increase, the need for self-organization and dynamic reconfigurations is becoming more and more important, and therefore the convergence of grid computing ...
IPSN
2004
Springer
14 years 4 months ago
2004
Springer
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
PADS
2003
ACM
14 years 4 months ago
2003
ACM
Wireless networks’ models differ from wired ones at least in the innovative dynamic effects of host-mobility and open-broadcast nature of the wireless medium. Topology changes d...
HPCA
1999
IEEE
14 years 3 months ago
1999
IEEE
Much research has been done in fast communication on clusters and in protocols for supporting software shared memory across them. However, the end performance of applications that...