Minimal, Deadlock Free and o(n) Space Memory Routing for k-ary n-cubes with Wraparound Connections.

M. B. Hadim, Ibrahima Sakho

Browse the full PDPTA paper archive.