Data Rearrangement between Radix-k and L
โ
Myung M. Bae; R. Venkatesan; Bella Bose
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 150 KB
The k-ary n-cube is one of the popular topologies for interconnecting processors in multicomputers. This paper studies the difference in communication requirements between two Lee distance Gray codes when moving data from processors in normal radix k order to those in Gray code order in k-ary n-cube