The Periodic Balanced Sorting Network

Document Type

Article

Publication Date

1-10-1989

Abstract

A periodic sorting network consists of a sequence of identical blocks. In this paper, the periodic balanced sorting network, which consists of log n blocks, is introduced. Each block, called a balanced merging block, merges elements on the even input lines with those on the odd input lines. The periodic balanced sorting network sorts n items in O1989 time using (n/2)(log n)2 comparators. Although these bounds are comparable to many existing sorting networks, the periodic structure enables a hardware implementation consisting of only one block with the output of the block recycled back as input until the output is sorted. An implementation of our network on the shuffle exchange interconnection model in which the direction of the comparators are all identical and fixed is also presented. © 1989, ACM. All rights reserved.

Identifier

0024750290 (Scopus)

Publication Title

Journal of the ACM Jacm

External Full Text Location

https://doi.org/10.1145/76359.76362

e-ISSN

1557735X

ISSN

00045411

First Page

738

Last Page

757

Issue

4

Volume

36

This document is currently not available here.

Share

COinS