Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Multicomputer networks: message-based parallel processing
Multicomputer networks: message-based parallel processing
Topological Properties of Hypercubes
IEEE Transactions on Computers
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
Error Control Coding, Second Edition
Error Control Coding, Second Edition
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
Resource Placement in Torus-Based Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Information Processing Letters
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
Characterizing r-perfect codes in direct products of two and three cycles
Information Processing Letters
Quasi-perfect resource placements for two-dimensional toroidal networks
Journal of Parallel and Distributed Computing
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
Computers and Electrical Engineering
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Chromatic sets of power graphs and their application to resource placement in multicomputer networks
Computers & Mathematics with Applications
Strongly Hamiltonian laceability of the even k-ary n-cube
Computers and Electrical Engineering
Resource placement in three-dimensional tori
Parallel Computing
The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube
The Journal of Supercomputing
Characterizing r-perfect codes in direct products of two and three cycles
Information Processing Letters
Fault-tolerant resource placement in balanced hypercubes
Information Sciences: an International Journal
Resource placement in Cartesian product of networks
Journal of Parallel and Distributed Computing
Reflections about a single checksum
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube
Discrete Applied Mathematics
Resource placement in networks using chromatic sets of power graphs
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Hi-index | 14.99 |
While a certain resource in the hypercube may be shared by cube nodes to lower the cost, multiple copies of a shared resource often exist in the hypercube to reduce contention, and thus the potential delay, in fetching any shared copy. It is desirable that one employs as few resource copies as possible to ensure that every node is able to reach the resource in a given number of hops, achieving efficient resource placement. This placement method also keeps system performance degradation minimal after one resource copy becomes unavailable due to a fault. First, we consider placing multiple copies of a certain resource in a way that every cube node without the resource is adjacent to a specified number of resource copies. The use of our developed perfect and quasiperfect multiple-adjacency codes makes it possible to arrive at efficient solutions to this placement problem in a simple and systematic manner for an arbitrary hypercube. We then deal with the generalized resource placement in the hypercube such that every node without the resource can reach no less than a specified number of resource copies in no more than a certain number of hops, using as few resource copies as possible. Our placement results yield lowest potential access contention for a given number of resource copies (i.e., cost), particularly useful for large-scale hypercubes.