Some Complexity Results for Matrix Computations on Parallel Processors
Journal of the ACM (JACM)
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
Optimal Sorting Algorithms for Parallel Computers
IEEE Transactions on Computers
Optimal algorithms for stable dimension permutations on Boolean cubes
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
A radix-2 FFT on connection machine
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
IEEE Transactions on Computers
An algebraic theory for modeling direct interconnection networks
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Index Transformation Algorithms in a Linear Algebra Framework
IEEE Transactions on Parallel and Distributed Systems
A simple architecture for constant time sorting machines
ACM SIGARCH Computer Architecture News
FFTs on mesh connected computers
Parallel Computing
An Efficient Architecture for the In-Place Fast Cosine Transform
Journal of VLSI Signal Processing Systems
Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags
IEEE Transactions on Computers
| Hi-index | 14.99 |
The most effective use of mesh-connected array processors is achieved by paying careful attention to the organization of data. Storage and movement of the elements of multidimensional arrays of data within a multidimensional store for a particular problem is a difficult task, often handled in an ad hoc way. For an important class of problems, considerable conceptual simplification arises from considering a specification of the mapping rather than the physical location of data.