### 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 language | English (US) |
---|---|

Pages (from-to) | 3087-3096 |

Number of pages | 10 |

Journal | Applied Optics |

Volume | 34 |

Issue number | 17 |

DOIs | |

State | Published - Jun 10 1995 |

### Fingerprint

### ASJC Scopus subject areas

- Atomic and Molecular Physics, and Optics

### Cite this

*Applied Optics*,

*34*(17), 3087-3096. https://doi.org/10.1364/AO.34.003087

**Constant-time parallel sorting algorithm and its optical implementation using smart pixels.** / Louri, Ahmed; Hatch, James A.; Na, Jongwhoa.

Research output: Contribution to journal › Article

*Applied Optics*, vol. 34, no. 17, pp. 3087-3096. https://doi.org/10.1364/AO.34.003087

}

TY - JOUR

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

AU - Louri, Ahmed

AU - Hatch, James A.

AU - Na, Jongwhoa

PY - 1995/6/10

Y1 - 1995/6/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84975646161&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84975646161&partnerID=8YFLogxK

U2 - 10.1364/AO.34.003087

DO - 10.1364/AO.34.003087

M3 - Article

AN - SCOPUS:84975646161

VL - 34

SP - 3087

EP - 3096

JO - Applied Optics

JF - Applied Optics

SN - 1559-128X

IS - 17

ER -