The New Class of g-Chain Periodic Sorters

Authors

Ronald I. Becker, University of Cape Town
David Nassimi, Department of Computer Science
Yehoshua Perl, Department of Computer Science

Document Type

Article

Publication Date

11-1-1998

Abstract

Aperiodic sorteris a sorting network that is a cascade of a number of identicalblocks, where outputiof each block is inputiof the next block. Previously, Dowd, Perl, Rudolph, and Saks introduced thebalancedmerging network, withN=2^kinputs/outputs and logNstages of comparators. Using a very intricate proof, they showed that a cascade of logNsuch blocks constitutes a sorting network. In this paper, we introduce a large class of merging networks with the same periodic property. This class contains 2^N/2-1networks, whereN=2^kis the number of inputs. The balanced merger is one network in this class. Other networks use fewer comparators. We provide a very simple and elegant correctness proof based on the recursive structure of the networks. © 1998 Academic Press.

Identifier

0040635099 (Scopus)

Publication Title

Journal of Parallel and Distributed Computing

External Full Text Location

https://doi.org/10.1006/jpdc.1998.1485

ISSN

07437315

First Page

206

Last Page

222

Issue

2

Volume

54

Recommended Citation

Becker, Ronald I.; Nassimi, David; and Perl, Yehoshua, "The New Class of g-Chain Periodic Sorters" (1998). Faculty Publications. 16299.
https://digitalcommons.njit.edu/fac_pubs/16299