Parallelism in tape-sorting

1 April 1974

journal article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 17 (4), 202-204
https://doi.org/10.1145/360924.360941

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.

Keywords

PROCESSING TIME
STACKS
QUEUES
METHOD B
EXTERNAL SORTING
METHOD A
TAPE SORTING
PARALLELISM

Cited by 16 articles