Sorting on a mesh-connected parallel computer

Authors:
C. D. Thompson;H. T. Kung
Affiliations:
-;-
Venue:
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Year:
1976

Citing 2
Cited 5

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computer organization and algorithms for very-high speed computations.

Computer organization and algorithms for very-high speed computations.

Parallel graph algorithms

ACM Computing Surveys (CSUR)
Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Fast parallel sorting algorithms

Communications of the ACM
Divide-and-Conquer for Parallel Processing

IEEE Transactions on Computers

Quantified Score

Hi-index	0.03

Visualization

Abstract

Two algorithms for sorting n2 elements on an n×n mesh-connected processor array that require 0(n) routing and comparison steps are presented. The best previous algorithms take time 0(n log n). Our algorithms are shown to be optimal in time within small constant factors.