The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
Constant time sorting on a processor array with a reconfigurable bus system
Information Processing Letters
The design of a network-based arithmetic processor
The design of a network-based arithmetic processor
Computer Arithmetic: Principles, Architecture and Design
Computer Arithmetic: Principles, Architecture and Design
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
IEEE Transactions on Parallel and Distributed Systems
Unified algebraic computations on cyclic permutation networks
Unified algebraic computations on cyclic permutation networks
The Design of an Optoelectronic Arithmetic Processor Based on Permutation Networks
IEEE Transactions on Computers
| Hi-index | 14.98 |
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.