Efficient vectorization of forward/backward substitutions in solving sparse linear equations

Date
1994
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the 7th Mediterranean Electrotechnical Conference, MELECON 1994
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
309 - 312
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

Vector processors have promised an enormous increase in computing speed for computationally intensive and time-critical power system problems which require the repeated solution of sparse linear equations. Due to short vectors processed in these applications, standard sparsity-based algorithms need to be restructured for efficient vectorization. This paper presents a novel data storage scheme and an efficient vectorization algorithm that exploits the intrinsic architectural features of vector computers such as sectioning and chaining. As the benchmark, the solution phase of the Fast Decoupled Load Flow algorithm is used in simulations. The relative performances of the proposed and existing vectorization schemes are evaluated, both theoretically and experimentally, on IBM 3090/VF.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)