Issue No. 12 - December (1994 vol. 43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.338104
<p>Inner product and matrix operations find extensive use in algebraic computations. In this brief contribution, we introduce a new parallel computation model, called a permutation network processor, to carry out these computations efficiently. Unlike the traditional parallel computer architectures, computations on this model are carried out by composing permutations on permutation networks. We show that the sum of N algebraic numbers on this model can be computed in O(1) time using N processors. We further show that the inner product and matrix multiplication can both be computed on this model in O(1) time at the cost of O(N) and O(N/sup 3/), respectively, for N element vectors, and N/spl times/N matrices. These results compare well with the time and cost complexities of other high level parallel computer models such as PRAM and CRCW PRAM.</p>
computational complexity; parallel architectures; matrix algebra; constant time inner product; matrix computations; permutation network processors; algebraic computations; parallel computation model; cost complexities; time complexities; PRAM; CRCW PRAM.
M. Lin and A. Yavuz Oruc, "Constant Time Inner Product and Matrix Computations on Permutation Network Processors," in IEEE Transactions on Computers, vol. 43, no. , pp. 1429-1434, 1994.