Title :
Rearrangeability of 2 log N-1 shuffle/exchange network
Author :
Al-Hallaq, Abdulraouf Y.
Author_Institution :
Dept. of Math., Kuwait Univ., Safat, Kuwait
Abstract :
It is proved that the 2 log N-1 S/E (shuffle/exchange) network is rearrangeable for all N. This proof combines the concept of functional equivalence and K.Y. Lee´s (1985) proof of rearrangeability. A routing algorithm emerges as a natural result for passing any arbitrary permutation
Keywords :
neural nets; arbitrary permutation; functional equivalence; rearrangeability; routing algorithm; shuffle/exchange network; Computer networks; Multiprocessor interconnection networks; Routing; Sorting; Switches;
Conference_Titel :
Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-1984-8
DOI :
10.1109/TAI.1989.65356
