The connection machine
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
BLITZEN: a highly integrated massively parallel machine
Journal of Parallel and Distributed Computing - Massively parallel computation
Meshes with reconfigurable buses
Proceedings of the fifth MIT conference on Advanced research in VLSI
The Massively Parallel Processor
The Massively Parallel Processor
Computer Architectures for Spatially Distributed Data
Computer Architectures for Spatially Distributed Data
IEEE Transactions on Parallel and Distributed Systems
Time-Optimal Domain-Specific Querying on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Podality-Based Time-Optimal Computations on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
Time- and VLSI-Optimal Sorting on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Constant-Time Algorithms for Constrained Triangulations on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry
IEEE Transactions on Parallel and Distributed Systems
Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
An efficient self-simulation algorithm for reconfigurable meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Scalable Hardware-Algorithms for Binary Prefix Sums
IEEE Transactions on Parallel and Distributed Systems
Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications
IEEE Transactions on Parallel and Distributed Systems
Using bus linearization to scale the reconfigurable mesh
Journal of Parallel and Distributed Computing
Square Meshes Are Not Optimal for Convex Hull Computation
IEEE Transactions on Parallel and Distributed Systems
Integer and Floating Point Matrix-Vector Multiplication on the Reconfigurable Mesh
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Some Image Processing Algorithms on a RAP with Wider Bus Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Geometric Data Structures on a Reconfigurable Mesh, with Applications
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Timing for Associative Operations on the MASC Model
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient List Ranking Algorithms on Reconfigurable Mesh
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Cellular Automata with Dynamically Reconfigurable Buses
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
A Scalable VLSI Architecture for Binary Prefix Sums
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting
Journal of Parallel and Distributed Computing
Time and work optimal simulation of basic reconfigurable meshes on hypercubes
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Polymorphic processor arrays (PPAs), two-dimensional mesh-connected arrays ofprocessors in which each processor is equipped with a switch able to interconnect itsfour NEWS ports, are discussed. The main features of PPA are that it models a realisticclass of parallel computers, it supports the definition of high level programming models, it supports virtual parallelism, and it supports low complexity algorithms in a number ofapplication fields. Both the PPA computation model and the PPA programming model are presented. It is shown that the PPA computation model is realistic by relating it to thedesign of the polymorphic torus (PT) chip. It is also shown that the PPA programmingmodel is scalable by demonstrating that any algorithm having O(p) complexity on a virtual PPA of size square root m* square root m, has O(k p) complexity on a PPA of size square root n* square root n, with m k n and k integers. Some application algorithms in the area of numerical analysis and graph processing are presented.