Skip to main content
Log in

Perfect Distance-d Placements in 2D Toroidal Networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

A perfect distance-d placement distributes a limited number of resources in a multicomputer parallel system so that every non-resource node is within a distance d or less from exactly one resource node. In this paper, we prove a necessary and sufficient condition for the existence of perfect distance-d placements in 2D toroidal networks. Furthermore, we describe how to generate these placements when they exist.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B. AlBdaiwi AlMohammad and B. Bose. I/O placements in 2D toroidal networks. In IEEE International Parallel Processing Symposium, pp. 431–438, April 1998.

  2. B. AlBdaiwi AlMohammad and B. Bose. On distance-d placements in 3D tori. In International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'2001), volume 4, pp. 1733–1739, June 2001.

    Google Scholar 

  3. B. AlBdaiwi AlMohammad and B. Bose. On resource placements in 3D tori. In The 5th World Multi-Conference on Systemics, Cybernetics and Informatics, volume 5, pp. 96–101, July 2001.

    Google Scholar 

  4. M. Bae and B. Bose. Resource placement in torus-based networks. In IEEE International Parallel Processing Symposium, pp. 327–331, April 1996.

  5. M. Bae and B. Bose. Spare processor allocation for fault-tolerance in torus-based multicomputers. In IEEE International Symposium on Fault-Tolerant Computing, pp. 282–291, June 1996.

  6. M. Bae and B. Bose. Resource placement in torus-based networks. IEEE Transaction on Computers, 46(10):1083–1092, October 1997.

    Google Scholar 

  7. E. Berlekamp. Algebraic coding theory, McGraw-Hill Inc., New York, 1968.

    Google Scholar 

  8. B. Bose, R. Broeg, Y. Kwon, and Y. Ashir. Lee distance and topological properties of k-ary n-cubes. IEEE Transactions on Computers, 44(8):1021–1030, August 1995.

    Google Scholar 

  9. H. Chen and N. Tzeng. Fault-tolerant resource placement in hypercube computers. In International Conference on Parallel Processing, volume 1, pp. 515–524, 1991.

    Google Scholar 

  10. H. Chen and N. Tzeng. Efficient resource placement in hypercubes using multiple-adjacency codes. IEEE Transaction on Computers, 43(1):23–33, January 1994.

    Google Scholar 

  11. W. Dally, P. Carvey, and L. Dennison. Architecture of the Avici terabit switch/router. In Hot Interconnects Symposium VI, pp. 41–50, 1998.

  12. S. Golomb and L. Welch. Algebric coding and the Lee metric. In H. Mann, ed., Error Correcting Codes: Proceedings of a Symposium Conducted by Mathematics Research Center, pp. 175–194. John Wiley & Sons, Inc., May 1968.

  13. M. Livingston and Q. Stout. Distributing resources in hypercube computers. In 3rd Conference on Hypercube Concurrent Computers and Applications, volume 1, pp. 222–231, 1988.

    Google Scholar 

  14. M. Livingston and Q. Stout. Perfect dominating sets. Congressus Numerantium, 79:187–203, 1990.

    Google Scholar 

  15. W. Oed. Massively parallel processor system CRAY T3D. Technical report, Cray Research GmbH, November 1993.

  16. G. Pfister. An Introduction to the Infiniband Architecture, IEEE Press, 2001.

  17. P. Ramanathan and S. Chalasani. Resource placement in k-ary n-cubes. In International Conference on Parallel Processing, volume 2, pp. 133–140, 1992.

    Google Scholar 

  18. P. Ramanathan and S. Chalasani. Resource placement with multiple adjacency constraints in k-ary n-cubes. IEEE Transaction on Parallel and Distributed Systems, 6(5):511–519, May 1995.

    Google Scholar 

  19. A. Reddy and P. Banerjee. Design, analysis, and simulation of I/O architectures for hypercube multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(2):140–151, April 1990.

    Google Scholar 

  20. S. Scott and G. Thorson. The cray T3E network: Adaptive routing in high performance 3D torus. In HOT Interconnects IV, Stanford University, August 15–16, 1996.

  21. C. Seitz, N. Boden, J. Seizovic, and W. Su. The design of the Caltech Mosaic C multicomputer. In University of Washington Symposium on Integrated systems, pp. 1–22, March 1993.

  22. C. Seitz. Submicron systems architecture project semiannual technical report. Technical Report Caltec-CS-TR-88-18, California Inst. of Technology, November 1988.

  23. C. Seitz, W. Athas, C. Flaig, A. Martin, J. Seizovic, C. Steele, and W. Su. The architecture and programming of the Ametek series 2010. In Third Conference on Hypercube Concurrent Computers and Applications, pp. 33–37, January 1988.

  24. N. Tzeng and G. Feng. Resource allocation in cube network systems based on the covering radius. IEEE Transactions on Parallel and Distributed Systems, 7(4):328–342, April 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bader F. Albdaiwi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Albdaiwi, B.F., Livingston, M.L. Perfect Distance-d Placements in 2D Toroidal Networks. The Journal of Supercomputing 29, 45–57 (2004). https://doi.org/10.1023/B:SUPE.0000022572.95414.27

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:SUPE.0000022572.95414.27

Navigation