This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Resource Placement in Torus-Based Networks
October 1997 (vol. 46 no. 10)
pp. 1083-1092

Abstract—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.

[1] M.M. Bae and B. Bose, "Resource Placement in Torus-Based Networks," Proc. IEEE Int'l Parallel Processing Symp., pp. 327-331, Apr. 1996.
[2] M.M. Bae and B. Bose, "Spare Processor Allocation for the Fault-Tolerance in Torus-Based Multicomputers," Proc. 26th Ann. Int'l Symp. Fault-Tolerant Computing, pp. 282-291, June 1996.
[3] E.R. Berlekamp, Algebraic Coding Theory.New York: McGraw-Hill, 1968.
[4] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 33, no. 4, pp. 323-333, Apr. 1984.
[5] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of k-Ary n-Cubes," IEEE Trans. Computers, vol. 44, no. 8, pp. 1,021-1,030, Aug. 1995.
[6] H.-L. Chen and N.-F. Tzeng, "Fault-Tolerant Resource Placement in Hypercube Computers," Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 517-524, 1991.
[7] H.-L. Chen and N.-F. Tzeng, "Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes," IEEE Trans. Computers, vol. 43, no. 1, pp. 23-33, Jan. 1994.
[8] G.-M. Chiu and C.S. Raghavendra, "Resource Allocation in Hypercube Systems," Proc. Fifth Distributed Memory Computing, vol. 1, pp. 894-902, Apr. 1990.
[9] S.W. Golomb and L.R. Welch, "Algebraic Coding and the Lee Metric," Error-correcting Codes: Proc. of a Symp. Conducted by the Mathematics Research Center, H.B. Mann, ed., pp. 175-194. John Wiley&Sons, May 1968.
[10] R.L. Graham and N.J.A. Sloane, "On the Covering Radius of Codes," IEEE Trans. Information Theory, vol. 31, no. 3, pp. 385-401, May 1985.
[11] C.Y. Lee, "Some Properties of Nonbinary Error-Correcting Codes," IRE Trans. Information Theory, pp. 77-82, June 1958.
[12] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[13] M. Livingston and Q.F. Stout, "Perfect Dominating Sets," Congressus Numerantium, vol. 79, pp. 187-203, 1990.
[14] S.P. Lloyd, "Binary Block Coding," Bell System Technical J., pp. 517-535, Mar. 1957.
[15] M.D. Noakes, D.A. Wallach, and W.J. Dally, "The J-Machine Multicomputer: An Architectural Evaluation," Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 224-235, May 1993.
[16] W. Oed, "Massively Parallel Processor System CRAY T3D," technical report, Cray Research GmbH, Nov. 1993.
[17] P. Ramanathan and S. Chalasani, "Resource Placement in k-Ary n-Cubes," Proc. Int'l Conf. Parallel Processing, vol. 2, pp. 133-140, 1992.
[18] P. Ramanathan and S. Chalasani, "Resource Placement with Multiple Adjacency Constraints in k-Ary n-Cubes," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 5, pp. 511-519, May 1995.
[19] A.L.N. Reddy, P. Banerjee, and S.G. Abraham, "I/O Embedding in Hypercubes," Proc. Int'l Conf. Parallel Processing, pp. 331-338, Aug. 1988.
[20] C.L. Seitz et al., "The Architecture and Programming of the Ametak Series 2010," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 33-37, Jan. 1988.
[21] C.L. Seitz et al., "Submicron Systems Architecture Project Semiannual Technical Report," Technical Report Caltec-CS-TR-88-18, California Inst. of Tech nology, Nov. 1988.
[22] N.-F. Tzeng and G.-L. Feng, "On Resource Allocation in Binary n-Cube Systems," Proc. 22nd Int'l Conf. Parallel Processing, vol. II, pp. 209-212, Aug. 1993.
[23] N.F. Tzeng and G.-L. Feng, "Resource Allocation in Cube Network Systems Based on the Covering Radius," IEEE Trans. Parallel and Distributed Systems, pp. 328-342, Apr. 1996.

Index Terms:
Error-correcting code, Lee distance, resource placement, torus network, k-ary n-cube.
Citation:
Myung M. Bae, Bella Bose, "Resource Placement in Torus-Based Networks," IEEE Transactions on Computers, vol. 46, no. 10, pp. 1083-1092, Oct. 1997, doi:10.1109/12.628393
Usage of this product signifies your acceptance of the Terms of Use.