Deriving concentrators from binary sorters using half cleaners

Many non-blocking and self-routing interconnection networks are based on the radix sorting paradigm which requires the design of concentrator modules to distribute the given inputs to subnetworks for the recursive calls. To that end, binary sorters are often used that sort the inputs in each recursive call by one bit of their destination addresses starting with the most significant bit down to the least significant one. It is well-known that the use of more general concentrators instead of binary sorters may lead to more efficient circuits. However, the design of concentrators turned out to be a challenging task for many decades. In this paper, we construct from any binary sorter a corresponding concentrator by means of Batcher's half cleaner circuit. This way, we can improve many interconnection networks that are based on binary radix sorting in that we replace their binary sorters by the corresponding concentrators obtained by our optimization. We have implemented various binary sorters and their corresponding concentrators and demonstrate by experimental results the improvements we achieved this way.

[1]  Mike Müller,et al.  Faster Sorting Networks for $17$, $19$ and $20$ Inputs , 2014, ArXiv.

[2]  Klaus Schneider,et al.  An Efficient Self-Routing and Non-Blocking Interconnection Network on Chip , 2017, NoCArc@MICRO.

[3]  Hasan Çam,et al.  Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks , 2003, SIAM J. Comput..

[4]  M. Pinsker,et al.  On the complexity of a concentrator , 1973 .

[5]  Mike Müller,et al.  New Bounds on Optimal Sorting Networks , 2015, CiE.

[6]  Alan Huang,et al.  Starlite: a wideband digital switch , 1991 .

[7]  Wen-Tsuen Chen,et al.  A New Self-Routing Permutation Network , 1996, IEEE Trans. Computers.

[8]  A. Yavuz Oruç,et al.  Design of efficient and easily routable generalized connectors , 1995, IEEE Trans. Commun..

[9]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[10]  Howard Jay Siegel,et al.  Study of multistage SIMD interconnection networks , 1978, ISCA '78.

[11]  F. Chung On concentrators, superconcentrators, generalizers, and nonblocking networks , 1979, The Bell System Technical Journal.

[12]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[13]  Gene Eu Jan,et al.  Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network , 1993, IEEE Trans. Computers.

[14]  Sartaj Sahni,et al.  Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.

[15]  Michael Frank,et al.  Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten) , 2014, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence.

[16]  A. Yavuz Oruç,et al.  Adaptive Binary Sorting Schemes and Associated Interconnection Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[17]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[18]  A. Yavuz Oruç,et al.  Efficient Nonblocking Switching Networks for Interprocessor Communications in Multiprocessor Systems , 1995, IEEE Trans. Parallel Distributed Syst..

[19]  A. Yavuz Oruç,et al.  High performance concentrators and superconcentrators using multiplexing schemes , 1994, IEEE Trans. Commun..

[20]  Jakub Závodný,et al.  Optimal Sorting Networks , 2013, LATA.

[21]  Peter Schneider-Kamp,et al.  Sorting Networks: to the End and Back Again , 2015, J. Comput. Syst. Sci..

[22]  Klaus Schneider,et al.  Verifying the concentration property of permutation networks by BDDs , 2016, 2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE).

[23]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[24]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[25]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[26]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[27]  Daniel Bundala,et al.  Optimal-depth sorting networks , 2014, J. Comput. Syst. Sci..

[28]  A. Yavuz Oruç,et al.  A Self-Routing Permutation Network , 1990, J. Parallel Distributed Comput..

[29]  Kyungsook Y. Lee On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks , 1985, IEEE Trans. Computers.

[30]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[31]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[32]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[33]  A. Yavuz Oruç,et al.  A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[34]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[35]  Madihally J. Narasimha The Batcher-banyan self-routing network: universality and simplification , 1988, IEEE Trans. Commun..

[36]  Frederick W. Hegeman Sorting networks , 1993 .

[37]  Madihally J. Narasimha A recursive concentrator structure with applications to self-routing switching networks , 1994, IEEE Trans. Commun..