Parallel Bitonic Record Sort - An Effective Algorithm for the Realization of a Post Processor.

Abstract

A fast and parallel sorting algorithm is proposed. The algorithm is an improvement over the bitonic sort. This algorithm is particularly suitable for sorting records on the basis of field values of the records. Furthermore, it lends itself effectively for the realization of a hardware sorter with multiple parallel processors and minimal interconnections among the processors.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1979
Accession Number
ADA068661

Entities

People

  • David K. Hsiao
  • Jayanata Banerjee

Organizations

  • Ohio State University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Broadcasting
  • Comparators
  • Computers
  • Computing Devices
  • Contracts
  • Databases
  • Efficiency
  • Environment
  • Microprocessors
  • New York
  • Parallel Processors
  • Precision
  • Sequences
  • Test And Evaluation

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Parallel and Distributed Computing.