Processor Allocation in k-ary n-cube Multiprocessors

Authors:
Po-Jen Chuang;Chih-Ming Wu
Affiliations:
-;-
Venue:
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
1997

Citing 0
Cited 5

Fast Compaction in Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Optimal FPGA module placement with temporal precedence constraints

Proceedings of the conference on Design, automation and test in Europe
Optimization of Dynamic Hardware Reconfigurations

The Journal of Supercomputing
Allocating Precise Submeshes in Mesh Connected Systems

IEEE Transactions on Parallel and Distributed Systems
Higher-Dimensional Packing with Order Constraints

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Composed of various topologies, the k-ary n-cube system is desirable for accepting and executing topologically different tasks. In this paper, we propose a new allocation strategy to utilize the large amount of processor resources in the k-ary n-cubes. Our strategy is an extension of the TC strategy on hypercubes and is able to recognize all subcubes with different topologies. Simulation results show that with such full subcube recognition ability and no internal fragmentation, our strategy depicts constantly better performance than the other strategies, such as the Free-list strategy on k-ary n-cubes and the Sniffing strategy.