000 02228naa a2200289 a 4500
003 AR-LpUFIB
005 20250311170247.0
008 230201s2003 xx o 000 0 eng d
024 8 _aDIF-M2650
_b2742
_zDIF002556
040 _aAR-LpUFIB
_bspa
_cAR-LpUFIB
100 1 _aTinetti, Fernando Gustavo
245 1 0 _aEfficient broadcasts and simple algorithms for parallel linear algebra computing in clusters
490 0 _a^p Datos electrónicos (1 archivo : 246 KB)
500 _aFormato 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)
520 _aThis paper presents a natural and efficient implementation for the classical broadcast message passing routine which optimizes performance of Ethernet based clusters. A simple algorithm for parallel matrix multiplication is specifically designed to take advantage of both, parallel computing facilities (CPUs) provided by clusters, and optimized performance of broadcast messages on Ethernet based clusters. Also, this simple parallel algorithm proposed for matrix multiplication takes into account the possibly heterogeneous computing hardware and maintains a balanced workload of computers according to their relative computing power. Performance tests are presented on a heterogeneous cluster as well as on a homogeneous cluster, where it is compared with the parallel matrix multiplication provided by the ScaLAPACK library. Another simple parallel algorithm is proposed for LU matrix factorization (a general method to solve dense systems of equations) following the same guidelines used for the parallel matrix multiplication algorithm. Some performance tests are presented over a homogeneous cluster.
534 _aParallel and Distributed Processing Symposium, 2003.
650 4 _aPROCESAMIENTO PARALELO
650 4 _aALGORITMOS PARALELOS
650 4 _aCLUSTERS
650 4 _aÁLGEBRA LINEAL
650 4 _aREDES LOCALES
650 4 _aINTERCONEXIÓN DE REDES
650 4 _aCOMUNICACIÓN DE DATOS
700 1 _aLuque, Emilio
856 4 0 _uieeexplore.ieee.org/stamp/stamp.jsp?arnumber1213364&isnumber27277
942 _cCP
999 _c52435
_d52435