A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Routing Partial Permutations in General Interconnection Networks based on Radix Sorting
In general, sorting networks can be used as interconnection networks in that the inputs are simply sorted according to their target addresses. If the target addresses form a permutation of the addresses, this is obviously correct since the sorting algorithm routes each message to the output with the desired target address. However, if not all inputs need a connection to one of the outputs, partial permutations are obtained since then some input addresses are not mapped to any output address atdoi:10.15496/publikation-25668 fatcat:lhl22tsx5bhrbgj6jl3ley5i6e