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-t and perfect/quasi-perfect j-adjacency placement in a κ-ary n-cube and a torus using Lee (1958) distance error-correcting codes
Published in:
Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
Date of Conference: 15-19 Apr 1996