Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
ALGORITHMS FOR EFFICIENT VECTORIZATION OF REPEATED SPARSE POWER SYSTEM NETWORK COMPUTATIONS
 

Summary: ALGORITHMS FOR EFFICIENT VECTORIZATION OF
REPEATED SPARSE POWER SYSTEM NETWORK COMPUTATIONS
Cevdet Aykanat, Member ˜
Ozlem ˜
Ozg˜u Nezih G˜uven, Member
Computer Engineering Department Electrical Engineering Department
Bilkent University Middle East Technical University
Ankara, Turkey Ankara, Turkey
Abstract -- Standard sparsity­based algorithms used in power sys­
tem applications need to be restructured for efficient vectorization
due to the extremely short vectors processed. Further, intrinsic
architectural features of vector computers such as chaining and
sectioning should also be exploited for utmost performance. This
paper presents novel data storage schemes and vectorization algo­
rithms that resolve the recurrence problem, exploit chaining and
minimize the number of indirect element selections in the repeated
solution of sparse linear system of equations widely encountered
in various power system problems. The proposed schemes are
also applied and experimented for the vectorization of power mis­
match calculations arising in the solution phase of FDLF which in­

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences