Resource Placement in Torus-Based Networks

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 perfectiquasi-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.

[1]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[2]  Quentin F. Stout,et al.  PERFECT DOMINATING SETS , 1990 .

[3]  Parameswaran Ramanathan,et al.  Resource Placement with Multiple Adjacency Constraints in k-ary n-Cubes , 1995, IEEE Trans. Parallel Distributed Syst..

[4]  Parameswaran Ramanathan,et al.  Resource Placement in k-Ary n-Cubes , 1992, ICPP.

[5]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[6]  N. J. A. Sloane,et al.  On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.

[7]  Hsing-Lung Chen,et al.  Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes , 1994, IEEE Trans. Computers.

[8]  Nian-Feng Tzeng,et al.  Resource Allocation in Cube Network Systems Based on the Covering Radius , 1996, IEEE Trans. Parallel Distributed Syst..

[9]  Alain J. Martin,et al.  Submicron Systems Architecture , 1993 .

[10]  C. Y. Lee,et al.  Some properties of nonbinary error-correcting codes , 1958, IRE Trans. Inf. Theory.

[11]  Cauligi S. Raghavendra,et al.  Resource Allocation in Hypercube Systems , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[12]  Myung M. Bae,et al.  Spare processor allocation for fault tolerance in torus-based multicomputers , 1996, Proceedings of Annual Symposium on Fault Tolerant Computing.

[13]  Michael D. Noakes,et al.  The J-machine multicomputer: an architectural evaluation , 1993, ISCA '93.

[14]  Nian-Feng Tzeng,et al.  Fault-Tolerant Resource Placement in Hypercube Computers , 1991, ICPP.

[15]  Myung M. Bae,et al.  Resource placement in torus-based networks , 1996, Proceedings of International Conference on Parallel Processing.

[16]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[17]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[18]  Charles L. Seitz.  Submicron Systems Architecture Project: Semiannual Technical Report , 1989 .

[19]  Nian-Feng Tzeng,et al.  On Resources Allocation in Binary n-Cube Network Systems , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[20]  S. P. Lloyd.  Binary block coding , 1957 .

[21]  Alain J. Martin,et al.  The architecture and programming of the Ametek series 2010 multicomputer , 1988, C3P.