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
Resource Allocation in Cube Network Systems Based on the Covering Radius
IEEE Transactions on Parallel and Distributed Systems
Coloring graph products—a survey
Discrete Mathematics - Special issue on combinatorics
Efficient VLSI Layouts for Homogeneous Product Networks
IEEE Transactions on Computers
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
Reliable broadcasting in product networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
A Theory for Total Exchange in Multidimensional Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
On the fractional chromatic number, the chromatic number, and graph products
Discrete Mathematics
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Design, Analysis, and Simulation of I/O Architectures for Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Generalized Algorithm for Parallel Sorting on Product Networks
IEEE Transactions on Parallel and Distributed Systems
Resource Placement in Torus-Based Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Constructing Edge-Disjoint Spanning Trees in Product Networks
IEEE Transactions on Parallel and Distributed Systems
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
Perfect Distance-d Placements in 2D Toroidal Networks
The Journal of Supercomputing
Fault diameter of Cartesian product graphs
Information Processing Letters
Hi-index | 0.00 |
The utilization of the limited resources of a multiprocessor or multicomputer system is a primary performance issue which is crucial for the design of many scheduling algorithms. While many of the existing parallel machines benefit from a regular product network topology, almost none of the previous resource placement techniques have come to recognize and exploit this inherent regularity. This paper introduces several novel algorithms for deriving resource placement schemes in product networks based on the assumption of perfect resource placement in their underling basic graphs. Our techniques use known schemes for the basic networks as their building blocks for deploying the resource placement scheme in the product network. This seriously cuts down the expenses required for deploying and rescaling the network. In particular, we propose some efficient algorithms for adjacency placement in a product of k heterogeneous graphs. Furthermore, we extend our approach and present algorithms for distant resource placement in product networks.