Some Results Concerning Data Routing in Array Processors

Some properties of k-dimensional cyclic networks are derived and used to give some algorithmic timings for the transposition of rectangular sets of data in an array processor's memory. General results are produced which can be applied to ICL's distributed array processor (DAP).