Sciweavers

1113 search results - page 28 / 223
» Performance under Failures of DAG-based Parallel Computing
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
IPPS
2003
IEEE
14 years 21 days ago
A Low Cost Fault Tolerant Packet Routing for Parallel Computers
This work presents a new switching mechanism to tolerate arbitrary faults in interconnection networks with a negligible implementation cost. Although our routing technique can be ...
Valentin Puente, José A. Gregorio, Ram&oacu...
IPSN
2004
Springer
14 years 23 days 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...
IPPS
2005
IEEE
14 years 1 months ago
MegaProto: A Low-Power and Compact Cluster for High-Performance Computing
“MegaProto” is a proof-of-concept prototype for our project “Mega-Scale Computing Based on Low-Power Technology and Workload Modeling”, implementing our key idea that a mi...
Hiroshi Nakashima, Hiroshi Nakamura, Mitsuhisa Sat...
ICPADS
2002
IEEE
14 years 10 days ago
Performance Evaluation of Distributed Computing Paradigms in Mobile Ad Hoc Sensor Networks
The emergence of mobile ad hoc sensor networks has brought new challenges to traditional network design. This paper focuses on the study at the application layer. In specific, it...
Yingyue Xu, Hairong Qi