The Community for Technology Leaders
Proceedings International Conference on Parallel Processing Workshops (2001)
Valencia, Spain
Sept. 3, 2001 to Sept. 7, 2001
ISBN: 0-7695-1260-7
pp: 0327
Rajgopal Kannan , Louisiana State University
Sibabrata Ray , The University of Alabama
ABSTRACT
Abstract: The Banyan network is shown to have a computationally unsuitable structure for finding maximum passable subpermutations, which is prove d NP-complete. Using some non-blocking properties on the Cube and Reverse Banyan networks, a network topologically equivalent to the Batcher sorter, but functionally equivalent to the Batcher-Banyan network is derived for routing incomplete permutations. A log_2 N(2w-1) stage radix sorter for w-bit inputs, including duplicate inputs, that uses only log_2 N +1bit address headers for routing through each 2 log_2 N stages is shown, which can be used in sort-MIN type packet switches. Space-time sorting networks based on these principles are derive d, which can be used in hierarchical wavelength multiplexed optical networks.
INDEX TERMS
CITATION

R. Kannan and S. Ray, "Sorting Networks with Applications to Hierarchical Optical Interconnects," Proceedings International Conference on Parallel Processing Workshops(ICPPW), Valencia, Spain, 2001, pp. 0327.
doi:10.1109/ICPPW.2001.951969
95 ms
(Ver 3.3 (11022016))