Issue No. 06 - June (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.277294
<p>A systematic approach for mapping application tasks to hypercubes is proposed. This method is based on a partitioning algorithm in which the final mapping is rendered as a task-node tuple assignment for an n-cube system. For this method, a single-tasking environment in which each task is assigned to a unique processor is assumed. Dilation-bound and expansion-ratio parameters are used to evaluate the efficacy of this mapping algorithm. An algorithm that minimizes the expansion-ratio parameter is introduced. In addition, an algorithm that reduces the dilaton bound is proposed. Because of the structured formation of the algorithms, they can be applied to any given task structure. As an illustration of the effectiveness of this method, the proposed algorithms are applied to mapping complete binary and d-ary tree task structures to hypercubes.</p>
dilaton bound; mapping application tasks; hypercubes; partitioning algorithm; n-cube system; expansion-ratio; tree task structures; hypercube networks; resource allocation.
A. Kavianpour, N. Bagherzadeh, "A Systematic Approach for Mapping Application Tasks in Hypercubes", IEEE Transactions on Computers, vol. 42, no. , pp. 742-746, June 1993, doi:10.1109/12.277294