Resource placement in three-dimensional tori

Authors:
Hamid Mahini;Hamid Sarbazi-Azad
Affiliations:
Department of Computer Engineering, Sharif University of Technology, Tehran, Iran and School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran;Department of Computer Engineering, Sharif University of Technology, Tehran, Iran and School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
Venue:
Parallel Computing
Year:
2009

Citing 15
Cited 0

Performance Analysis of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers
The J-machine multicomputer: an architectural evaluation

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Resource Placement with Multiple Adjacency Constraints in k-ary n-Cubes

IEEE Transactions on Parallel and Distributed Systems
On the k-ary hypercube

Theoretical Computer Science - Special issue on design and analysis of geometrical algorithms for robot motion planning and vision
Fault Diameter of k-ary n-cube Networks

IEEE Transactions on Parallel and Distributed Systems
Resource Placement in Torus-Based Networks

IEEE Transactions on Computers
Performance of the CRAY T3E multiprocessor

SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
iWarp: A 100-MOPS, LIW Microprocessor for Multicomputers

IEEE Micro
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes

IEEE Transactions on Computers
Lee Distance and Topological Properties of k-ary n-cubes

IEEE Transactions on Computers
Limits on Interconnection Network Performance

IEEE Transactions on Parallel and Distributed Systems
Gray Codes for Torus and Edge Disjoint Hamiltonian Cycles

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
On resource placements in 3D tori

Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Perfect Distance-d Placements in 2D Toroidal Networks

The Journal of Supercomputing
Quasi-perfect resource placements for two-dimensional toroidal networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In massively parallel processing systems that incorporate hundreds and thousands of processing nodes, the problem of placing a limited number of resources (e.g. printers, disks, software copies, etc.) over processing nodes is of great importance. In this paper, we investigate resource placement in the three-dimensional torus network which is the underlying interconnection network in most current multicomputer. We show that there exists an irregular distance-1 placement only for tori of the form 2x3ix6j,i,j@?N. In addition, we present a new formal proof for the necessary and sufficient conditions for the existence of irregular distance-d placement in 3D tori.