论文信息 - A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array

A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array

We show how to off-line route any permutation of a n X n meshconnected processor array in 2.5n 3 steps with at most 6 packets per processor per time step and in 2.25n +3 steps with at most 8 packets per processor per time step.

Danny Krizanc

[1] Fred S. Annexstein,et al. A unified approach to off-line permutation routing on parallel networks , 1990, SPAA '90.

[2] Fillia Makedon,et al. A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues , 1989, SPAA.