Sciweavers

1600 search results - page 75 / 320
» Clustering for opportunistic communication
Sort
View
HPDC
1999
IEEE
15 years 10 months ago
Starfish: Fault-Tolerant Dynamic MPI Programs on Clusters of Workstations
This paper reports on the architecture and design of Starfish, an environment for executing dynamic (and static) MPI-2 programs on a cluster of workstations. Starfish is unique in ...
Adnan Agbaria, Roy Friedman
EUROPAR
2007
Springer
15 years 10 months ago
Fast and Efficient Total Exchange on Two Clusters
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
Emmanuel Jeannot, Luiz Angelo Steffenel
FGCN
2008
IEEE
240views Communications» more  FGCN 2008»
16 years 19 days ago
Data Compression Algorithm Based on Hierarchical Cluster Model for Sensor Networks
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...
Tongsen Wang, Lei Wang, Zhijun Xie, Ronghua Yang
CLUSTER
2007
IEEE
16 years 15 days ago
Dynamic scheduling of multi-processor tasks on clusters of clusters
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
Sascha Hunold, Thomas Rauber, Gudula Rünger
IPCCC
2007
IEEE
16 years 14 days ago
Scalable and Decentralized Content-Aware Dispatching in Web Clusters
— In this paper, we propose a novel and efficient content-aware dispatching algorithm. Our approach eliminates the potential bottleneck and the single point of failure problems ...
Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan