Data movement techniques for the pyramid computer
SIAM Journal on Computing
A prototype pyramid machine for hierarchical cellular logic
Parallel computer vision
IEEE Transactions on Computers
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Mapping pyramid algorithms into hypercubes
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Simulation of binary trees and X-trees on pyramid networks
Journal of Parallel and Distributed Computing
Pipelined implementation of the multiresolution Hough transform in a pyramid multiprocessor
Pattern Recognition Letters
Incomplete hypercubes: embeddings of tree-related networks
Journal of Parallel and Distributed Computing
Structured Computer Vision; Machine Perception through Hierarchical Computation Structures
Structured Computer Vision; Machine Perception through Hierarchical Computation Structures
Image Shrinking and Expanding on a Pyramid
IEEE Transactions on Parallel and Distributed Systems
Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses
IEEE Transactions on Parallel and Distributed Systems
Efficient Mappings of Pyramid Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal communication primitives and graph embeddings on hypercubes
Optimal communication primitives and graph embeddings on hypercubes
| Hi-index | 0.00 |
Embedding one parallel architecture into another is very important in the area of parallel processing because parallel architectures can vary widely. Given a pyramid architecture of (4N - 1)/3 nodes and height N, this paper presents a mapping method to embed the pyramid architecture into a 4k+1+2/3 × 2N-1-k × 2N-1-k mesh for 0 ≤ k ≤ N - 1. Our method has dilation max{4k, 2N-2-k} and expansion 1 + 2/4k+1. When k = (N - 2)/3, the pyramid can be embedded into a 4N+1/3+2/3 × 22N-1/3 × 22N-1/3 mesh with dilation 22N-4/3 and expansion 1 + 2/4N+1/3. This result has an optimal expansion when N is sufficiently large and is superior to the previous mapping methods [10] in terms of the dilation and expansion.