Issue No. 02 - April (1991 vol. 2)

ISSN: 1045-9219

pp: 236-241

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.89068

ABSTRACT

<p>It is shown that a number of classical problems from linear algebra and graph theory,including instances of the algebraic path problem, matrix multiplication, matrix triangularization, and matrix transpose, can be solved using the same basic recurrence. Asimple mapping of the recurrence onto a unidirectional linear array is discussed. Qualitative advantages to programming linear arrays using this approach include uniformity of design, simplicity of programming, and scalability to larger problems. The major disadvantage is that the resulting algorithms are not necessarily optimal.</p>

INDEX TERMS

Index Termslinear algebra; graph theory; algebraic path problem; matrix multiplication; matrixtriangularization; matrix transpose; unidirectional linear array; graph theory; linearalgebra; matrix algebra; parallel algorithms

CITATION

D.R. O'Hallaron, "Uniform Approach for Solving some Classical Problems on a Linear Array",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 2, no. , pp. 236-241, April 1991, doi:10.1109/71.89068