Constant-time parallel sorting algorithm and its optical implementation using smart pixels.

@article{Louri1995ConstanttimePS,
  title={Constant-time parallel sorting algorithm and its optical implementation using smart pixels.},
  author={Ahmed Louri and James A. Hatch and Jong Whoa Na},
  journal={Applied optics},
  year={1995},
  volume={34 17},
  pages={
          3087-96
        }
}
Sorting is a fundamental operation that has important implications in a vast number of areas. For instance, sorting is heavily utilized in applications such as database machines, in which hashing techniques are used to accelerate data-processing algorithms. It is also the basis for interprocessor message routing and has strong implications in video telecommunications. However, high-speed electronic sorting networks are difficult to implement with VLSI technology because of the dense, global… 
View on PubMed
www2.engr.arizona.edu
5 Citations
Background Citations
2
Methods Citations
1

Figures and Topics from this paper

5 Citations

Citation Type

Citation Type

Fault tolerance analysis of odd-even transposition sorting networks
  • S. Salloum, A. L. Perrie
  • Computer Science
    1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)
  • 1999
TLDR
This paper investigates the fault-tolerance properties of a special class of sorting networks called the odd-even transposition sorting networks, which have a simple and reliable hardware structure, which is easy to implement with VLSI technology.
Dynamic wavelength assignment for realizing hypercube-based Bitonic sorting on wavelength division multiplexing linear arrays
TLDR
This article addresses the DWA problem for realizing the hypercube-based Bitonic sorting on WDM linear arrays with limited wavelength resources, and introduces the notions of dimension congestion and dimension embedding.
Fault tolerance analysis of odd-even transposition sorting networks with single pass and multiple passes
  • S. Salloum, Der-Haw Wang
  • Computer Science
    2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490)
  • 2003
TLDR
A formal proof is presented for a well-known conjecture that states the odd-even transposition sorting networks are one-fault tolerant with respect to stuck-at-X fault at any internal comparators.
Implementations of a Model of Physical Sorting
We define a computational model of physical devices that have a parallel atomic operation that transforms their input, an unordered list, in such a way that their output, the sorted list, can be…
Analog recurrent neural network simulation, £(log 2 n) unordered search, and bitonic sort with an optically-inspired model of computation
TLDR
The model is inspired by the theory of Fourier optics and it is proved the model can simulate analog recurrent neural networks, thus establishing a lower bound on its computational power.

References

SHOWING 1-10 OF 36 REFERENCES
The Parallel Enumeration Sorting Scheme for VLSI
TLDR
A new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting is designed, suitable for VLSI implementation.
Sorting with optical compare-and-exchange modules.
TLDR
This paper describes implementations of C&E in a variety of optical device technologies capable of performing latching and nonlatching logic and outlines potential application areas for each technology.
Optical content-addressable parallel processor for high-speed database processing.
TLDR
An overview of the architecture followed by its optical implementation is presented, which delivers a speedup factor of n over conventional optical database architectures, where n is the number of rows in a database table.
Systolic sorting in a sequential input/output environment
Sorting networks and their applications
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several…
Optoelectronic data filter for selection and projection.
TLDR
The architecture of an optoelectronic filter that is capable of performing selection and projection operations on a two-dimensional data array in a relational database environment is presented and aims to reduce the effective data rate between the highly parallel optical storage and the low input data rate conventional electronic computer.
The Analysis and Design of Some New Sorting Machines
TLDR
A classification method for parallel sorting architectures is presented for comparison of existing designs and a detailed design and analysis of distributor based sorters (parallel balanced tree sorters) which can sort lists whose size is proportional to the memory space available and whose speed is proportionalto the number of sorting elements used.
A Special-Function Unit for Sorting and Sort-Based Database Operations
TLDR
Achieving efficiency in database management functions is a fundamental problem underlying many computer applications and special hardware units should be used, if they are cost- effective, to execute or to assist the execution of these software algorithms.
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
TLDR
This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
Implementations of smart pixels for optoelectronic processors and interconnection systems. I. Optoelectronic gate technology
For part II see ibid., vol. 11, no. 10, pp. 1670-1680 (Oct. 1993). Several of the common approaches to smart pixel technology, including smart pixels based on optoelectronic integrated circuits and…
...
1
2
3
4
...