Sciweavers

256 search results - page 3 / 52
» Exchanging messages of different sizes
Sort
View
EUROPAR
2007
Springer
13 years 11 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
ISPAN
1999
IEEE
13 years 11 months ago
Complete Exchange Algorithms in Wormhole-Routed Torus Networks: A Divide-and-Conquer Strategy
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
Si-Gwan Kim, Seung Ryoul Maeng, Jung Wan Cho
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 8 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
SAC
2006
ACM
13 years 7 months ago
From spontaneous total order to uniform total order: different degrees of optimistic delivery
A total order protocol is a fundamental building block in the construction of distributed fault-tolerant applications. Unfortunately, the implementation of such a primitive can be...
Luís Rodrigues, José Mocito, Nuno Ca...
ISPDC
2005
IEEE
14 years 29 days ago
Active Zero-copy: A performance study of non-deterministic messaging
Zero-copy communication exchanges the messages among the buffers that are allocated and locked before the communication itself. This communication style fits into applications th...
Shinichi Yamagiwa, Keiichi Aoki, Koichi Wada