New Parallel Sorting Schemes.

Abstract

This paper describes a family of parallel sorting algorithms for a multiprocessor system. These algorithms are enumeration sorts and comprise the following phases: count acquisition: the keys are subdivided into subsets and for each key the number of smaller keys (count) in every subset is determined; rank determination: the rank of a key is the sum of the previously obtained counts; data rearrangement: each key is placed in the position specified by its rank. The basic novelty of the algorithms is the use of parallel merging to implement count acquisition.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1977
Accession Number
ADA056886

Entities

People

  • Franco P. Preparata

Organizations

  • University of Illinois Urbana–Champaign

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Acquisition
  • Algorithms
  • Bits
  • Buildings And Structures
  • Computational Science
  • Computations
  • Computer Programming
  • Computers
  • Contracts
  • Electronics
  • Governments
  • Illinois
  • Parallel Computing
  • Security
  • Sequences
  • United States
  • United States Government

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Defense Acquisition Program Management
  • Graph Algorithms and Convex Optimization.