Topological Properties of Hypercubes
IEEE Transactions on Computers
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
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
IEEE Transactions on Parallel and Distributed Systems
The impact of spatial layout of jobs on parallel I/O performance
Proceedings of the sixth workshop on I/O in parallel and distributed systems
Resource Placement in Torus-Based Networks
IPPS '96 Proceedings of the 10th 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
Quasi-perfect resource placements for two-dimensional toroidal networks
Journal of Parallel and Distributed Computing
Optimizing I/O server placement for parallel I/O on switch-based irregular networks
The Journal of Supercomputing
Optimizing server placement for parallel I/O in switch-based clusters
Journal of Parallel and Distributed Computing
Resource placement in three-dimensional tori
Parallel Computing
Optimizing server placement in distributed systems in the presence of competition
Journal of Parallel and Distributed Computing
Optimizing i/o server placement for parallel i/o on switch-based irregular networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
The problem of placing resources in a $k$-ary $n$-cube $(k\,{\char'076}\,2)$ is considered in this paper. For a given $j \geq 1,$ resources are placed such that each nonresource node is adjacent to $j$ resource nodes. We first prove that perfect $j$-adjacency placements are impossible in $k$-ary $n$-cubes if $n\,{\char'074}\,j\,{\char'074}\,2n.$ Then, we show that a perfect $j$-adjacency placement is possible in $k$-ary $n$-cubes when one of the following two conditions is satisfied: 1) if and only if $j$ equals $2n$ and $k$ is even, or 2) if $1 \leq j \leq n$ and there exist integers $q$ and $r$ such that $q$ divides $k$ and $q^r - 1 = 2n/j.$ In each case, we describe an algorithm to obtain perfect $j$-adjacency placements. We also show that these algorithms can be extended under certain conditions to place $j$ distinct types of resources in a such way that each nonresource node is adjacent to a resource node of each type. For the cases when perfect $j$-adjacency placements are not possible, we consider approximate $j$-adjacency placements. We show that the number of copies of resources required in this case either approaches a theoretical lower bound on the number of copies required for any $j$-adjacency placement or is within a constant factor of the theoretical lower bound for large $k.$Index Terms驴Resource allocation, multiprocessors, hypercubes, mesh connected computers, interconnection network, fault-tolerance.