Issue No.10 - October (1997 vol.46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.628393
<p><b>Abstract</b>—This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost/performance trade-offs in a torus parallel machine. This paper contains some solutions to perfect distance-<it>t</it> and perfect/quasi-perfect <it>j</it>-adjacency placement in a <it>k</it>-ary <it>n</it>-cube and a torus using Lee distance error-correcting codes. It also presents generalized resource placement (<it>j</it>-adjacency with distance-<it>t</it> placement) methods based on the concept of covering radius of Lee distance codes.</p>
Error-correcting code, Lee distance, resource placement, torus network, k-ary n-cube.
Myung M. Bae, "Resource Placement in Torus-Based Networks", IEEE Transactions on Computers, vol.46, no. 10, pp. 1083-1092, October 1997, doi:10.1109/12.628393