Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Performance evaluation of a parallel I/O subsystem for hypercube multicomputers
Journal of Parallel and Distributed Computing - Special issue on parallel I/O 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)
Resource Placements in 2D Tori
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
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
Resource placement in three-dimensional tori
Parallel Computing
| Hi-index | 0.00 |
This work addresses the problem of having a limited number of resources in a multicomputer system that each processing element needs to access. Placing these resources in the system so that all processing elements can access them in a comparable manner is called the ''resource placement problem''. In this paper, we present resource placement methods for two-dimensional toroidal networks. These methods assure uniformity such that the resources are distributed uniformly over the network where each resource is assigned an equivalent number of non-resource nodes. Hence, the resources' related traffic would have a balanced distribution over the network. This increases the overall network utilization rather than having parts of the network congested while others are barely utilized. Furthermore, the presented methods minimize the maximum distance between a non-resource node and its closest resource. There are many messages in a multi-computer system competing for its communication channels. The longer the path, traversed by a message, the higher the probability becomes that the message blocks or is blocked by other messages. Indeed, reducing the distance between a resource and a non-resource decreases the average network latency and increases the traffic volume a network could handle before it saturates. Analytical and simulation results show that the presented methods are superior to some existing methods in terms of reducing the average network latency.