Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6656
Title: Merging and Sorting Networks with the Topology of the Omega Network
Authors: Bilardi, Gianfranco
Keywords: computer science
technical report
Issue Date: Mar-1987
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-816
Abstract: We consider a class of comparator networks obtained from the omega permutation network by replacing each switch with a comparator exchanger of arbitrary direction. These networks are all isomorphic to each other, have merging capabilities, and can be used as building blocks of sorting networks in ways different from the standard merge-sort scheme. It is shown that the bitonic merger and the balanced merger are members of the class. These two networks were not previously known to be isomorphic.
URI: http://hdl.handle.net/1813/6656
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
87-816.pdf1.45 MBAdobe PDFView/Open
87-816.ps458.35 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us