Share Email Print

Proceedings Paper

Optical Implementation Of The Compare-And-Exchange Operation For Applications In Symbolic Computing
Author(s): C. W. Stirk; R. A. Athale; C. B. Friedlander
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The throughput of data-structure manipulation operations presently limits the applicability of relational database machines. Since most relational algebra operations can be treated as modifications of sorting algorithms, special-purpose hardware based on fast sorting algorithms should increase the performance of these machines. Parallel sorting algorithms representable as self-routing, multistage networks are ideal for optical implementation because they require global interconnects and simple parallel-processing units. The processing units perform a local operation called compare-and-exchange (C&E). Our goal is to realize fast optical sorting networks. Therefore, we describe C&E implementations in analog optics, and digital optics with all-optical, hybrid optoelectronic and polarization logic. Furthermore, we delineate application domains of the networks based on system and technology characteristics.

Paper Details

Date Published: 21 August 1987
PDF: 7 pages
Proc. SPIE 0754, Optical and Digital Pattern Recognition, (21 August 1987); doi: 10.1117/12.939982
Show Author Affiliations
C. W. Stirk, The BDM Corporation (United States)
R. A. Athale, The BDM Corporation (United States)
C. B. Friedlander, The BDM Corporation (United States)

Published in SPIE Proceedings Vol. 0754:
Optical and Digital Pattern Recognition
Hua-Kuang Liu; Paul S. Schenker, Editor(s)

© SPIE. Terms of Use
Back to Top