Data movement techniques for the pyramid computer
SIAM Journal on Computing
Pyramidal systems for computer vision
Architectural solutions for intermediate-level vision
Proceedings of the NATO Advanced Research workshop on Real-time object measurement and classification
Mesh Computer Algorithms for Computational Geometry
IEEE Transactions on Computers
Simulation of binary trees and X-trees on pyramid networks
Journal of Parallel and Distributed Computing
Pyramid computer algorithms for determining geometric properties of images
SCG '85 Proceedings of the first annual symposium on Computational geometry
Mapping pyramids into 3-D meshes
Nordic Journal of Computing
| Hi-index | 0.00 |
We consider primarily the simulation of large networks by smaller ones-an importantconsideration, because interconnection networks are typically of a fixed size, and yetapplications may employ networks of a larger size. Current research (Dingle andSudborough, 1993) describes methods to simulate common data structures and networkarchitectures on the pyramid. However, these simulations assume that the pyramid growswith the size of the network or data structure. Because unbounded growth is notfeasible, we address the issue of mapping several points of the guest data structure ornetwork to a single host processor. We determine how a small pyramid may efficientlysimulate the computation of a larger pyramid as well as that of tree networks.