Sciweavers

2941 search results - page 437 / 589
» Communication Performance Issues for Two Cluster Computers
Sort
View
IPSN
2004
Springer
15 years 11 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
WS
2004
ACM
15 years 11 months ago
A framework for wireless LAN monitoring and its applications
Many studies on measurement and characterization of wireless LANs (WLANs) have been performed recently. Most of these measurements have been conducted from the wired portion of th...
Jihwang Yeo, Moustafa Youssef, Ashok K. Agrawala
PARA
1995
Springer
15 years 10 months ago
ScaLAPACK Tutorial
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
Jack Dongarra, Antoine Petitet
ICS
2009
Tsinghua U.
15 years 11 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
SASN
2006
ACM
16 years 10 days ago
Location-aware key predistribution scheme for wide area wireless sensor networks
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...
Katerina Simonova, Alan C. H. Ling, Xiaoyang Sean ...