loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th Annual International Symposium on High Performance Computing Systems and Applications
Asynchronism for Iterative Algorithms in a Global Computing Environment
Moncton, NB, Canada
June 16-June 19
ISBN: 0-7695-1626-2
Jacques M. Bahi, Laboratoire d éInformatique de Franche-Comté
Sylvain Contassot-Vivier, Laboratoire d éInformatique de Franche-Comté
Raphaël Couturier, Laboratoire d éInformatique de Franche-Comté
The subject of this paper is to show the very high power of asynchronism for iterative algorithms in the context of global computing,that is to say, with machines scattered all around the world. The question is whether or not asynchronism helps to reduce the communication penalty and the overall computation time of a given parallel algorithm. The asynchronous programming model is applied to a given problem implemented with a multi-threaded environment and tested over two kinds of clusters of workstations; a homogeneous local cluster and a heterogeneous non-local one. The main features of this programming model are exhibited and the high efficiency and interest of such algorithms is pointed out.
Citation:
Jacques M. Bahi, Sylvain Contassot-Vivier, Raphaël Couturier, "Asynchronism for Iterative Algorithms in a Global Computing Environment," hpcs, pp.90, 16th Annual International Symposium on High Performance Computing Systems and Applications, 2002
Usage of this product signifies your acceptance of the Terms of Use.