Name
Abstract | ||
|---|---|---|
Improving communication performance is an important issue in cluster systems. This paper investigates the possibility of accelerating group communication at the level of message passing libraries. A new algorithm for implementing the broadcast communication primitive will be introduced. It enhances the performance of fully-switched cluster systems by using message decomposition and asynchronous communication. The new algorithm shows the dynamism and the portability of the software solutions, while it has a constant asymptotic time complexity achieved only with hardware support before. Test measurements show that the algorithm really has a constant time complexity, and in certain cases it can outperform the widely used binary tree approach by 100 percent. The presented algorithm can be used to increase the performance of broadcasting, and can also indirectly speed up various group communication primitives used in standard message passing libraries. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30218-6_27 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
message passing,binary tree,group communication,time complexity,asynchronous communication | Asynchronous communication,Broadcasting,Computer science,Broadcasting (networking),Communication in small groups,Software portability,Time complexity,Message passing,Distributed computing,Broadcast communication network | Conference |
Volume | ISSN | Citations |
3241 | 0302-9743 | 4 |
PageRank | References | Authors |
0.48 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sándor Juhász | 1 | 10 | 4.10 |
| Ferenc Kovács | 2 | 45 | 8.27 |