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

M. B. Hadim, Ibrahima Sakho. Minimal, Deadlock Free and o(n) Space Memory Routing for k-ary n-cubes with Wraparound Connections. In Hamid R. Arabnia, editor, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 1995, November 3-4, 1995, Georgia, USA. pages 511-520, CSREA Press, 1995.

Abstract

Abstract is missing.