Radix sort on the hypercube

https://doi.org/10.1016/0020-0190(91)90226-8Get rights and content

Abstract

This paper presents an implementation of the radix sort algorithm on the hypercube. For sorting n items in the range 0,…,R−1 our algorithm takes time O((log Rlog((np)+p log p))((np)log p + p log2p)) using p processors. The algoritm is based on a multiple routing procedure that we believe is of independent interest.

References (6)

  • A.V. Aho et al.

    The Design and Analysis of Computer Algorithms

    (1974)
  • A.V. Aho et al.

    Data Structures and Algorithms

    (1983)
  • C.P. Kruskal et al.

    Efficient parallel algorithms for graph problems

    Algorithmica

    (1990)
There are more references available in the full text version of this article.

Cited by (0)

View full text