This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Systematic Approach for Mapping Application Tasks in Hypercubes
June 1993 (vol. 42 no. 6)
pp. 742-746

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.

[1] A. Kavianpour and K. H. Kim, "Diagnosability of hypercubes under the pessimistic one-step diagnosis strategy,"IEEE Trans. Comput., vol. 40, no. 2, pp. 232-237, Feb. 1991.
[2] J. Kim, C. R. Das, and W. Lin, "A processor allocation scheme for hypercube computers," inProc. 1989 Int. Conf. Parallel Processing, 1989, pp. 231-238.
[3] Y. Moon, N. Bagherzadeh, and J. Sklansky, "Macropipelined multicomputer architecture for image analysis,"J. Opt. Soc. Am. A., vol. 6, no. 6, pp. 951-962, 1989.
[4] A. Y. Wu, "Mapping of tree networks into hypercubes,"J. Parallel Distributed Comput., vol. 2, pp. 238-249, 1985.
[5] S.-Y. Lee and J. K. Aggarwal, "A mapping strategy for parallel processing,"IEEE Trans. Comput., vol. C-36, pp. 433-442, Apr. 1987.
[6] S. H. Bokhari, "On the mapping problem,"IEEE Trans. Comput., vol. C-30, no. 3, pp. 207-214, 1981.
[7] J.-W. Hong, K. Mehlhorn, and A. Rosenberg, "Cost trade-offs in graph embeddings, with applications,"J. ACM, pp. 709-728, 1983.

Index Terms:
dilaton bound; mapping application tasks; hypercubes; partitioning algorithm; n-cube system; expansion-ratio; tree task structures; hypercube networks; resource allocation.
Citation:
A. Kavianpour, N. Bagherzadeh, "A Systematic Approach for Mapping Application Tasks in Hypercubes," IEEE Transactions on Computers, vol. 42, no. 6, pp. 742-746, June 1993, doi:10.1109/12.277294
Usage of this product signifies your acceptance of the Terms of Use.