Skip to main content
Log in

Periodic Merging Networks

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

We consider the problem of merging two sorted sequences on constant degree networks performing compare—exchange operations only. The classical solution to this problem is given by the networks based on Batcher's Odd—Even Merge and Bitonic Merge running in log(2n ) time. Due to the obvious log n lower bound for the runtime, this is time-optimal.

We present a new family of merging networks working in a completely different way than the previously known algorithms. They have a novel property of being periodic: this means that for some (small) constant k , each processing unit of the network performs the same operations at steps t and t+k (as long as t+k does not exceed the runtime). The only operations executed are compare—exchange operations, just like in the case of Batcher's networks. The architecture of the networks is very simple and easy to lay out.

We show that even for period 3 there is a network in our family merging two n -element sorted sequences in time O(log n ). Since each network of period 2 requires \(\Theta(n)\) steps to merge such sequences, 3 is the smallest period for which we may achieve a fast runtime.

In order to improve constants standing in front of log n we increment the period and tune the construction using additional techniques. We achieve the runtime 9 . . . log_3 n \(\approx\) 5.7 . . . log n for a network of period 4, and 2.25 . . . ((k+3)/(k-1+log 3))log n \(\approx\) 2.25 . . . log n for a network of period k+3 , for \(k\geq 1\) .

Due to the periodic design, our networks have small area complexity. For instance, if each processing unit requires O(1) area and a comparator uses a single wire of width O(1) connecting the processing elements, then our networks require \(\Theta((n/\log n)^2)\) area. This compares well with Batcher's networks that require area \(\Theta(n^2)\) .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received February 1997, and in revised form September 1997, and in final form February 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kutylowski, M., Lorys, K. & Oesterdiekhoff, B. Periodic Merging Networks . Theory Comput. Systems 31, 551–578 (1998). https://doi.org/10.1007/s002240000103

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002240000103

Keywords

Navigation