Communications of the ACM - Special section on computer architecture
The connection machine
Multicomputer networks: message-based parallel processing
Multicomputer networks: message-based parallel processing
Topological Properties of Hypercubes
IEEE Transactions on Computers
iPSC/2 system: a second generation hypercube
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
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
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
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
The impact of spatial layout of jobs on I/O hotspots in mesh networks
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
Optimizing I/O server placement for parallel I/O on switch-based irregular networks
The Journal of Supercomputing
Optimal Placement of Replicas in Data Grid Environments with Locality Assurance
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Optimal replica placement in hierarchical Data Grids with locality assurance
Journal of Parallel and Distributed Computing
Optimizing server placement for parallel I/O in switch-based clusters
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 Cartesian product of networks
Journal of Parallel and Distributed 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
A dynamic replica management strategy in data grid
Journal of Network and Computer Applications
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 | 0.00 |
When multiple copies of a certain resource exist in a cube network system, it is desirable that every nonresource node can reach the resource in a given number of hops. In this paper, we introduce systematic approaches to resource allocation in a cube system so that each nonresource node is connected with a specified number of resource copies and that the allocation performance measure of interest is optimized. The methodology used is based on the covering radius results of known codes. These codes aid in constructing desired linear codes whose codewords address nodes where resource copies are placed. The resource allocation problem is translated to an integer nonlinear program whose best possible solution can be identified quickly by taking advantage of basic properties derived from the known codes, yielding an optimal or near-optimal allocation result. Those basic properties lead to drastic time complexity reduction (up to several orders of magnitude smaller), in particular for large system sizes. Our approaches are applicable to any cube size, often arriving at more efficient allocation outcomes than what are attainable using prior schemes.