Asynchronism for iterative algorithms in a global computing environment

Author

Bahi, Jacques M. ; Contassot-Vivier, Sylvain ; Couturier, Raphael

Author_Institution

Lab. d´´Informatique de Franche-Comte, IUT de Belfort-Montbeliard, Belfort, France

fYear

2002

fDate

2002

Firstpage

90

Lastpage

97

Abstract

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.

Keywords

computational complexity; distributed algorithms; parallel algorithms; workstation clusters; asynchronism; asynchronous programming model; clusters of workstations; communication penalty; computation time; global computing; heterogeneous nonlocal cluster; homogeneous local cluster; iterative algorithms; multi-threaded environment; parallel algorithm; Clustering algorithms; Concurrent computing; Context; Differential equations; Distributed algorithms; Iterative algorithms; Parallel algorithms; Scattering; Testing; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Computing Systems and Applications, 2002. Proceedings. 16th Annual International Symposium on

Print_ISBN

0-7695-1626-2

Type

conf

DOI

10.1109/HPCSA.2002.1019139

Filename

1019139