This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost / performance tradeoffs in a torus parallel machine. This paper contains some solutions to perfect distance-tand perfect / quasi-perfect j-adjacency placement in a k-ary n-cube and a torus using Lee distance error-correcting codes.
Myung M. Bae, Bella Bose