The Community for Technology Leaders
Green Image
Issue No. 05 - May (2003 vol. 52)
ISSN: 0018-9340
pp: 645-657
Chansu Yu , IEEE
Ben Lee , IEEE Computer Society
<p><b>Abstract</b>—Due to its topological generality and flexibility, the <em>k</em>-ary <em>n</em>-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the <em>k</em>-ary <em>n</em>-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier <em>k</em>-ary <em>n</em>-cube allocation schemes based on conventional <it>slice partitioning</it> suffer from internal fragmentation of processors. In contrast, algorithms based on <em>job-based partitioning</em> alleviate the fragmentation problem but require higher time complexity. This paper proposes a new allocation scheme based on <em>isomorphic partitioning</em>, where the processor space is partitioned into higher dimensional isomorphic subcubes. The proposed scheme minimizes the fragmentation problem and is general in the sense that any size request can be supported and the host architecture need not be isomorphic. Extensive simulation study reveals that the proposed scheme significantly outperforms earlier schemes in terms of mean response time for practical size <em>k</em>-ary and <em>n</em>-cube architectures. The simulation results also show that reduction of external fragmentation is more substantial than internal fragmentation with the proposed scheme.</p>
k-ary n-cube, processor allocation, job scheduling, partitioning, performance evaluation.

B. Lee, M. Kang, H. Y. Youn, C. Yu and M. Kim, "Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems," in IEEE Transactions on Computers, vol. 52, no. , pp. 645-657, 2003.
92 ms
(Ver 3.3 (11022016))