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

Ahmed Louri, James A. Hatch, Jongwhoa Na

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

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 connectivity required. Optics eliminates this bottleneck by offering global interconnects, massive parallelism, and noninterfering communications. We present a parallel sorting algorithm and its efficient optical implementation. The algorithm sorts n data elements in few steps, independent of the number of elements to be sorted. Thus it is a constant-time sorting algorithm [i.e., O(1) time]. We also estimate the system’s performance to show that the proposed sorting algorithm can provide at least 2 orders of magnitude improvement in execution time over conventional electronic algorithms.

Original languageEnglish (US)
Pages (from-to)3087-3096
Number of pages10
JournalApplied Optics
Volume34
Issue number17
DOIs
StatePublished - Jun 10 1995

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Fingerprint Dive into the research topics of 'Constant-time parallel sorting algorithm and its optical implementation using smart pixels'. Together they form a unique fingerprint.

  • Cite this