Design of Optimal Array Processors for Two-Step Division-Free Gaussian Elimination
Summary :
The design of array processors for solving linear systems using two-step division-free Gaussian elimination method is considered. The two-step method can be used to improve the systems based on the one-step method in terms of numerical stability as well as the requirements for high-precision. In spite of the rather complicated computations needed at each iteration of the two-step method, we develop an innovative parallel algorithm whose data dependency graph meets the requirements for regularity and locality. Then we derive two-dimensional array processors by adopting a systematic approach to investigate the set of all admissible solutions and obtain the optimal array processors under linear time-space scheduling. The array processors is optimal in terms of the number of processing elements used.
- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.12 pp.1503-1511
- Publication Date
- 1999/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Algorithm and Computational Complexity
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shietung PENG, Stanislav G. SEDUKHIN, "Design of Optimal Array Processors for Two-Step Division-Free Gaussian Elimination" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 12, pp. 1503-1511, December 1999, doi: .
Abstract: The design of array processors for solving linear systems using two-step division-free Gaussian elimination method is considered. The two-step method can be used to improve the systems based on the one-step method in terms of numerical stability as well as the requirements for high-precision. In spite of the rather complicated computations needed at each iteration of the two-step method, we develop an innovative parallel algorithm whose data dependency graph meets the requirements for regularity and locality. Then we derive two-dimensional array processors by adopting a systematic approach to investigate the set of all admissible solutions and obtain the optimal array processors under linear time-space scheduling. The array processors is optimal in terms of the number of processing elements used.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_12_1503/_p
Copy
@ARTICLE{e82-d_12_1503,
author={Shietung PENG, Stanislav G. SEDUKHIN, },
journal={IEICE TRANSACTIONS on Information},
title={Design of Optimal Array Processors for Two-Step Division-Free Gaussian Elimination},
year={1999},
volume={E82-D},
number={12},
pages={1503-1511},
abstract={The design of array processors for solving linear systems using two-step division-free Gaussian elimination method is considered. The two-step method can be used to improve the systems based on the one-step method in terms of numerical stability as well as the requirements for high-precision. In spite of the rather complicated computations needed at each iteration of the two-step method, we develop an innovative parallel algorithm whose data dependency graph meets the requirements for regularity and locality. Then we derive two-dimensional array processors by adopting a systematic approach to investigate the set of all admissible solutions and obtain the optimal array processors under linear time-space scheduling. The array processors is optimal in terms of the number of processing elements used.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Design of Optimal Array Processors for Two-Step Division-Free Gaussian Elimination
T2 - IEICE TRANSACTIONS on Information
SP - 1503
EP - 1511
AU - Shietung PENG
AU - Stanislav G. SEDUKHIN
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 1999
AB - The design of array processors for solving linear systems using two-step division-free Gaussian elimination method is considered. The two-step method can be used to improve the systems based on the one-step method in terms of numerical stability as well as the requirements for high-precision. In spite of the rather complicated computations needed at each iteration of the two-step method, we develop an innovative parallel algorithm whose data dependency graph meets the requirements for regularity and locality. Then we derive two-dimensional array processors by adopting a systematic approach to investigate the set of all admissible solutions and obtain the optimal array processors under linear time-space scheduling. The array processors is optimal in terms of the number of processing elements used.
ER -
English
