Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Data optimization: allocation of arrays to reduce communication on SIMD machines
Journal of Parallel and Distributed Computing - Massively parallel computation
Elementary functions: algorithms and implementation
Elementary functions: algorithms and implementation
Active pages: a computation model for intelligent memory
Proceedings of the 25th annual international symposium on Computer architecture
Feynman and computation
An FPGA architecture for DRAM-based systolic computations
FCCM '97 Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines
Reconfigurable Architectures for General-Purpose Computing
Reconfigurable Architectures for General-Purpose Computing
Universal cellular automata based on the collisions of soft spheres
Collision-based computing
Complexity of reachability problems for finite discrete dynamical systems
Journal of Computer and System Sciences
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
Hi-index | 0.00 |
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for physical simulation, virtual-reality simulation, agent-based modeling, logic simulation, 2D and 3D image processing and rendering, and other volumetric data processing tasks. The range of applicability of such algorithms is completely dependant upon the lattice-sizes and processing speeds that are computationally feasible. Using embedded DRAM and a new technique for organizing SIMD memory and communications we can efficiently utilize 1 Tbit/sec of sustained memory bandwidth in each chip in an indefinitely scalable array of chips. This allows a 10,000-fold speedup per memory chip for these algorithms compared to the CAM-8 lattice gas computer, and is about one million times faster per memory chip for these calculations than a CM-2.