Abstract
Two algorithms for LU-decomposition on a transputer based reconfigurable MIMD parallel computer with distributed memory have been analyzed in view of the interdependence of granularity and execution time. In order to investigate this experimentally, LU-decomposition algorithms have been implemented on a parallel computer, the Parsytec SuperCluster 128. The results of this investigation may be summarized as follows. The LU-decomposition algorithms are very efficient on the parallel computer, if the ratio between problem size and number of processors is not too small. No loss of efficiency is to be expected, if the number of processors is increased only proportionally to the number of elements in the matrix being decomposed.KeywordsExecution TimeParallel ComputerParallel AlgorithmTriangular MatrixSystolic ArrayThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
