Data Movement Techniques for the Pyramid Computer

DOI10.1137/0216004zbMath0635.68011OpenAlexW2114377411MaRDI QIDQ3774926

Quentin F. Stout, Russ Miller

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

zbMATH Keywords

image processingmesh-connected computerpyramid computergraph-theoretic algorithmscomponent labelingdata movement techniques

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Theory of operating systems (68N25)

Related Items (12)

A bypassing path based routing algorithm for the pyramid structures ⋮ HETEROGENEOUS ALGORITHMS FOR IMAGE UNDERSTANDING ARCHITECTURE∗ ⋮ Parallel computation of discrete Voronoi diagrams ⋮ The \(3^{*}\)-connected property of pyramid networks ⋮ 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 ⋮ The triangular pyramid: Routing and topological properties ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Properties of a hierarchical network based on the star graph ⋮ Algorithmic construction of Hamiltonians in pyramids

This page was built for publication: Data Movement Techniques for the Pyramid Computer