Sparse equation systems in heterogeneous clusters of computers
Material type:
ArticleSeries: ^p Datos electrónicos (1 archivo : 89 KB)Subject(s): Online resources: Summary: This paper presents a parallelization strategy in heterogeneous clusters of the Gauss-Seidel’s method applied for the solution of sparse equation systems. From the point of view of the numerical solution for matrices of coefficients with low density of non null-elements, the standard lines of thought are followed, that is, only non-null elements are stored and iterative solution-search methods are used. Two basic guidelines are defined for the parallel algorithm: one-dimensional data distribution and broadcast messages for all data communications. One-dimensional data distribution eases the processing workload balance on heterogeneous clusters. The use of broadcast messages for every data communication is directly oriented to optimize performance on the the most common cluster interconnection: Ethernet. Experimental results obtained in a local network of heterogeneous computers are presented.
| Item type | Home library | Collection | Call number | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
Capítulo de libro
|
Biblioteca de la Facultad de Informática | Biblioteca digital | A0147 (Browse shelf(Opens below)) | Link to resource | No corresponde |
Browsing Biblioteca de la Facultad de Informática shelves, Collection: Biblioteca digital Close shelf browser (Hides shelf browser)
Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.) -- Disponible también en línea (Cons. 13/03/2009)
This paper presents a parallelization strategy in heterogeneous clusters of the Gauss-Seidel’s method applied for the solution of sparse equation systems. From the point of view of the numerical solution for matrices of coefficients with low density of non null-elements, the standard lines of thought are followed, that is, only non-null elements are stored and iterative solution-search methods are used. Two basic guidelines are defined for the parallel algorithm: one-dimensional data distribution and broadcast messages for all data communications. One-dimensional data distribution eases the processing workload balance on heterogeneous clusters. The use of broadcast messages for every data communication is directly oriented to optimize performance on the the most common cluster interconnection: Ethernet. Experimental results obtained in a local network of heterogeneous computers are presented.
Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA’05) Volume: 2 : 471- 474