N.Y.: IEEE (Institute of Electrical and Electronic Engineers)
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.
Relation:
一九九七國際平行架構、演算法暨網路研討會論文集=Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks(I-SPAN'97),頁211-214