Broadcasting and Embedding Algorithms for a Half Hypercube Interconnection Network
The half hypercube interconnection network, has been proposed as a new variation of the hypercube, reducing its degree by approximately half with the same number of nodes as an n-dimensional hypercube, Q n . This paper proposes an algorithm for one-to-many broadcasting in an n-dimensional half hypercube, HH n , and examines the embedding between hypercube and half hypercube graphs. The results show that the one-to-many broadcasting time of the HH n can be accomplished in n + 1 when n is an even number and in \( 2 \times \lceil n/ 2\rceil \) when n is an odd number. The embedding of HH n into Q n can be simulated in constant time O(n) and the embedding of Q n into HH n in constant time O(1).
KeywordsHalf hypercube One-to-many broadcasting Embedding
- 1.Kim JS, Kim M, Lee HO (2013) Analysis and design of a half hypercube interconnection network. ATACS 2013, LNEE. Springer, Heidelberg (will be appeared)Google Scholar
- 2.Kim M, Kim DW, Lee HO (2010) Embedding algorithms for star, bubble-sort, rotator-faber-moore, and pancake graphs. HPCTA 2010, LNCS, vol 6082. Springer, Heidelberg, pp 348–357Google Scholar
- 3.Lee HO, Sim H, Seo JH, Kim M (2010) Embedding algorithms for bubble-sort, macro-star, and transposition graphs. NPC 2010, LNCS, vol 6289. Springer, Heidelberg, pp 134–143Google Scholar
- 6.Leightoo FT (1992) Introduction to parallel algorithms and architectures: arrays, hypercubes. Morgan Kaufmann Publishers, San FranciscoGoogle Scholar
- 8.Feng T (1981) A survey of interconnection networks. IEEE computer 14:12–27Google Scholar