Data Movement Techniques for the Pyramid Computer
From MaRDI portal
Publication:3774926
DOI10.1137/0216004zbMath0635.68011MaRDI QIDQ3774926
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216004
image processing; mesh-connected computer; pyramid computer; graph-theoretic algorithms; component labeling; data movement techniques
68R10: Graph theory (including graph drawing) in computer science
68U99: Computing methodologies and applications
68N25: Theory of operating systems
Related Items
HETEROGENEOUS ALGORITHMS FOR IMAGE UNDERSTANDING ARCHITECTURE∗, The \(3^{*}\)-connected property of pyramid networks, A bypassing path based routing algorithm for the pyramid structures, The triangular pyramid: Routing and topological properties, Two-node-Hamiltonicity of enhanced pyramid networks, Properties of a hierarchical network based on the star graph, Computing convexity properties of images on a pyramid computer, Parallel computation of distance transforms, Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays, Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays, Algorithmic construction of Hamiltonians in pyramids
