The concurrent solution of large linear systems of equations on processor meshes of fixed size has been considered taking into account the basic requirements of computational efficiency and stability. A linear rotation based algorithm has been studied as a robust solution of linear problems well suited to be implemented on parallel architectures because of its regular computational structure. The exploitation of the intrinsic parallelism of the algorithm and the application of partitioning techniques have addressed a locally parallel globally sequential parallelization strategy. The method has been experimentally evaluated on different sized arrays of transputers, demonstrating that high computational efficiency can be achieved.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | A Linear Rotation Based Solution of Large Systems on a Transputer Array |
Autori: | |
Data di pubblicazione: | 1995 |
Rivista: | |
Abstract: | The concurrent solution of large linear systems of equations on processor meshes of fixed size has been considered taking into account the basic requirements of computational efficiency and stability. A linear rotation based algorithm has been studied as a robust solution of linear problems well suited to be implemented on parallel architectures because of its regular computational structure. The exploitation of the intrinsic parallelism of the algorithm and the application of partitioning techniques have addressed a locally parallel globally sequential parallelization strategy. The method has been experimentally evaluated on different sized arrays of transputers, demonstrating that high computational efficiency can be achieved. |
Handle: | http://hdl.handle.net/11567/192042 |
Appare nelle tipologie: | 01.01 - Articolo su rivista |