Notes on merging networks

Zhu Hong, Robert Sedgewick

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations


Several new results which contribute to the understanding of parallel merging networks are presented. First, a simple new explanation of the operation of Batcher's merging networks is offered. This view leads to the derivation of a modified version of Batcher's odd-even (m, n) network which has delay time [log(m + n)]. This is the same delay time as Batcher's bitonic (m, n) network, but it is achieved with substantially fewer comparators. Second, a correspondence is demonstrated between the number of comparators (and the delay time) for such networks and certain properties of binary number systems which have recently been extensively studied. Third, the (log(m + n)] delay time is shown to be optimal for a non-degenerate range of values of m and n.

Original languageEnglish (US)
Title of host publicationProceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982
PublisherAssociation for Computing Machinery
Number of pages7
ISBN (Print)0897910702
StatePublished - May 5 1982
Event14th Annual ACM Symposium on Theory of Computing, STOC 1982 - San Francisco, United States
Duration: May 5 1982May 7 1982

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017


Other14th Annual ACM Symposium on Theory of Computing, STOC 1982
Country/TerritoryUnited States
CitySan Francisco

All Science Journal Classification (ASJC) codes

  • Software


Dive into the research topics of 'Notes on merging networks'. Together they form a unique fingerprint.

Cite this