The architecture and programming of the Ametek series 2010 multicomputer
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Distributing resources in hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
The design of the Caltech Mosaic C multicomputer
Proceedings of the 1993 symposium on Research on integrated systems
Resource Placement with Multiple Adjacency Constraints in k-ary n-Cubes
IEEE Transactions on Parallel and Distributed Systems
Resource Allocation in Cube Network Systems Based on the Covering Radius
IEEE Transactions on Parallel and Distributed Systems
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
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
Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Resource Placement in Torus-Based Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Aspects of the InfiniBand(tm) Architecture
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
Spare processor allocation for fault tolerance in torus-based multicomputers
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Submicron Systems Architecture Project: Semiannual Technical Report
Submicron Systems Architecture Project: Semiannual Technical Report
Resource Placements in 2D Tori
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Quasi-perfect resource placements for two-dimensional toroidal networks
Journal of Parallel and Distributed Computing
Chromatic sets of power graphs and their application to resource placement in multicomputer networks
Computers & Mathematics with Applications
Resource placement in three-dimensional tori
Parallel Computing
Resource placement in Cartesian product of networks
Journal of Parallel and Distributed Computing
Resource placement in networks using chromatic sets of power graphs
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Designs, Codes and Cryptography
| Hi-index | 0.00 |
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.