Parallelism in tape-sorting

Authors:
Shimon Even
Affiliations:
The Weizmann Institute of Science, Rehovot, Israel
Venue:
Communications of the ACM
Year:
1974

Citing 0
Cited 10

A taxonomy of parallel sorting

ACM Computing Surveys (CSUR)
Sorting Large Files on a Backend Multiprocessor

IEEE Transactions on Computers
A low communication sort algorithm for a parallel database machine

VLDB '89 Proceedings of the 15th international conference on Very large data bases
Greed sort: optimal deterministic sorting on parallel disks

Journal of the ACM (JACM)
Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast parallel sorting algorithms

Communications of the ACM
Merging with parallel processors

Communications of the ACM
A hardware sort-merge system

IBM Journal of Research and Development
Exploiting parallelism for the performance enhancement of non-numeric applications

AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
Algorithm and hardware for a merge sort using multiple processors

IBM Journal of Research and Development

Quantified Score

Hi-index	48.25

Visualization

Abstract

Two methods for employing parallelism in tape-sorting are presented. Method A is the natural way to use parallelism. Method B is new. Both approximately achieve the goal of reducing the processing time by a divisor which is the number of processors.