Java multithreading-based parallel approximate arrow-type inverses.

Uloženo v:
Podrobná bibliografie
Název: Java multithreading-based parallel approximate arrow-type inverses.
Autoři: Gravvanis, George A., Epitropou, Victor N.
Zdroj: Concurrency & Computation: Practice & Experience; Jul2008, Vol. 20 Issue 10, p1151-1172, 22p, 3 Black and White Photographs, 4 Charts, 5 Graphs
Témata: JAVA programming language, MULTIPROCESSORS, ELECTRONIC data processing, PARALLEL algorithms, MATRIX inversion, PARALLEL programming, SIMULTANEOUS multithreading processors, CONJUGATE gradient methods
Abstrakt: A new parallel shared memory Java multithreaded design and implementation of the explicit approximate inverse preconditioning, for efficiently solving arrow-type linear systems on symmetric multiprocessor systems (SMPs), is presented. A new parallel algorithm for computing a class of optimized approximate arrow-type inverse matrix is introduced. The performance on an SMP, using Java multithreading, is investigated by solving arrow-type linear systems and numerical results are given. The parallel performance of the construction of the optimized approximate inverse and the explicit preconditioned generalized conjugate gradient square scheme, using a dynamic workload scheduling, is also presented. Copyright © 2007 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
Popis
Abstrakt:A new parallel shared memory Java multithreaded design and implementation of the explicit approximate inverse preconditioning, for efficiently solving arrow-type linear systems on symmetric multiprocessor systems (SMPs), is presented. A new parallel algorithm for computing a class of optimized approximate arrow-type inverse matrix is introduced. The performance on an SMP, using Java multithreading, is investigated by solving arrow-type linear systems and numerical results are given. The parallel performance of the construction of the optimized approximate inverse and the explicit preconditioned generalized conjugate gradient square scheme, using a dynamic workload scheduling, is also presented. Copyright © 2007 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
ISSN:15320626
DOI:10.1002/cpe.1262