This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Merging and Sorting Networks with the Topology of the Omega Network
October 1989 (vol. 38 no. 10)
pp. 1396-1403
A class of comparator networks obtained from the omega permutation network by replacing each switch with a comparator exchanger of arbitrary direction is considered. 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 and balanced mer

[1] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS Spring Joint Comput. Conf., vol. 32, Apr. 1968, pp. 307- 314.
[2] M. Dowd, Y. Perl, L. Rudolph, and M. Saks, "The balanced sorting network," inProc. ACM Princ. Distrib. Comput., Aug. 1983, pp. 161-172.
[3] Z. Ahong and R. Sedgewick, "Notes on merging networks," inProc. 14th Annu. ACM Symp. Theory Comput., San Francisco, CA, May 1982, pp. 296-302.
[4] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[5] D. Lawrie, "Access and alignment in an array processor,"IEEE Trans. Comput., vol. C-24, no. 12, pp. 1145-1155, Dec. 1975.
[6] M. C. Pease, "The indirect binaryn-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, no. 5, pp. 458-473, May 1977.
[7] Y. Perl, "The bitonic and odd-even networks are more than merging," The State University of New Jersey Rutgers DCS-TR-123, Feb. 1983.
[8] L. Rudolph, "A robust sorting network,"IEEE Trans. Comput., vol. C-34, no. 4, pp. 326-335, Apr. 1985.
[9] D. Steinberg, "Invariant properties of the shuffle-exchange and a simplified cost-effective version of the omega network,"IEEE Trans. Comput., vol. C-32, no. 5, pp. 444-450, May 1983.
[10] C. Wu and T. Ferg, "The universality of the shuffle-exchange network,"IEEE Trans. Comput., vol. C-30, no. 5, pp. 324-332, May 1981.

Index Terms:
sorting networks; omega network; comparator networks; omega permutation network; bitonic; mergers; network topology; switching networks.
Citation:
G. Bilardi, "Merging and Sorting Networks with the Topology of the Omega Network," IEEE Transactions on Computers, vol. 38, no. 10, pp. 1396-1403, Oct. 1989, doi:10.1109/12.35835
Usage of this product signifies your acceptance of the Terms of Use.