Quadrant architecture for fast in-place algorithms
Conference
·
OSTI ID:5365340
The architecture proposed is tailored to support Radix-2/sup k/ based in-place processing of pictorial data. The algorithms make use of signal-flow graphs to describe 2-dimensional in-place operations suitable for image processing. They may be executed on a general-purpose computer but may also be supported by a special parallel architecture. Major advantages of the scheme are in-place processing and parallel access to disjoint sections of memory only. A quadtree-like decomposition of the picture prevents blocking and queuing of private and common buses. 9 references.
- OSTI ID:
- 5365340
- Resource Relation:
- Conference: Sponsored by IEEE, Pasadena, CA, USA, 12 Oct 1983
- Country of Publication:
- United States
- Language:
- English
Similar Records
Communication-efficient parallel architectures and algorithms for image computations
Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architectures
Algorithms and architectures for high performance analysis of semantic graphs.
Miscellaneous
·
Sun Jan 01 00:00:00 EST 1989
·
OSTI ID:5365340
Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architectures
Journal Article
·
Fri May 01 00:00:00 EDT 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5365340
Algorithms and architectures for high performance analysis of semantic graphs.
Technical Report
·
Thu Sep 01 00:00:00 EDT 2005
·
OSTI ID:5365340