Resource placement in torus-based networks

作     者：Bae, MM Bose, B 

作者机构：OREGON STATE UNIV DEPT COMP SCI CORVALLIS OR 97331 USA 

出 版 物：《IEEE TRANSACTIONS ON COMPUTERS》 (IEEE Trans Comput)

年 卷 期：1997年第46卷第10期

页      面：1083-1092页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Oregon Advanced Computing Institute, (MIP-910852) National Science Foundation, NSF 

主　　题：error-correcting code Lee distance resource placement torus network k-ary n-cube 

摘      要：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-t and perfect/quasi-perfect j-adjacency placement in a k-ary n-cube and a torus using Lee distance error-correcting codes. It also presents generalized resource placement (j-adjacency with distance-t placement) methods based on the concept of covering radius of Lee distance codes.