By Topic

Parallel execution of Lanczos algorithm in a CAM systolic ring

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ko, C. ; Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA

The author presents an efficient array processing scheme to exploit Lanczos algorithm for solving a large-scale eigenvalue problem. He shows that an array of processing elements with content addressable memories (CAM), connected in a simple ring topology, can solve the problem efficiently. The nonzero elements of a problem matrix are stored in a content addressable memory for an efficient storage and the required operations are executed in a pipeline fashion around the systolic ring. The algorithm consists of two steps: Lanczos triangularisation followed by QR method to obtain full eigenvalues and eigenvectors. It is shown that the speedup obtained in such a system is almost linear with the number of processing elements used when the problem is partitioned to be executed with relatively small number of processing element

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990