loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second IEEE International Symposium on Cluster Computing and the Grid (CCGRID'02)
Berlin, Germany
May 21-May 24
ISBN: 0-7695-1582-7
Inside a dedicated parallel computer the communication times were generally modeled in the same way, independently of which processors communicate. In a network where the links among the computers are heterogeneous, or in hierarchical clusters, this might not be true anymore. Computers that have faster links, or are closer to each other should be able to exchange messages faster. These differences on communication times should be considered, not only for attributing tasks to the processors but also in global synchronization/communication. The goal of this paper is to study irregular all-to-all communications in a network of dedicated clusters.
Citation:
Alfredo Goldman, "Scalable Algorithms for Complete Exchange on Multi-Cluster Networks," ccgrid, pp.286, Second IEEE International Symposium on Cluster Computing and the Grid (CCGRID'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.