Efficient mapping scheme of ring topology onto tree-hypercubes

被引：0

作者：

Almobaideen, Wesam ^{[1
]}

Qatawneh, Mohammad ^{[1
]}

Sleit, Azzam ^{[1
]}

Salah, Imad ^{[1
]}

Al-Sharaeh, Saleh ^{[1
]}

机构：

[1] Department of Computer Science, King Abdulla II School for Informationa Technology, University of Jordan, Amman

来源：

Journal of Applied Sciences | 2007年 / 7卷 / 18期

关键词：

Hamiltonian cycle; Linear array; Mapping; Ring; Tree-hypercube network;

D O I：

10.3923/jas.2007.2666.2670

中图分类号：

学科分类号：

摘要：

The Tree-hypercubes network TH(s, d) is an interconnection network that is recursively defined and has excellent properties for scalable message passing computer systems. In this study we describe the ability of a TH(s, d) to implement algorithms that use the communication pattern of linear array and a ring to formulate a Hamiltonian cycle. We propose an algorithm for mapping a ring onto a tree-hypercubes which results in a dilation and congestion of one. © 2007 Asian Network for Scientific Information.

引用

页码：2666 / 2670

页数：4

共 12 条

[1] Caha R., Koubek V., Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets, J. Graph Theory, 51, pp. 137-169, (2005)
[2] Chang H.Y., Chen R.J., Embedding cycles in IEH graphs, Inform. Proc. Lett, 64, pp. 23-27, (1997)
[3] Goldie A.W., Krause G., Embedding rings with Krull dimension in artinian rings, J. Algebra, 182, pp. 534-545, (1996)
[4] Gupta A., Embedding trees into low dimensional Euclidean spaces, Discrete Comput. Geom, 24, pp. 105-116, (2000)
[5] Johnson S.L., Communication efficient basic linear algebra computations on hypercube architectures, J. Parallel Distributed Computing, 4, pp. 133-172, (1987)
[6] Kurose J.F., Ross K.W., Computer Networking, A Top-Down Approach Featuring the Internet, (2005)
[7] Leighton F.T., Introduction to Parallel Algorithms and Architecture: Arrays, (1992)
[8] Omari M., Abu-Salem H., Tree-Hypercubes: A Multiprocessor Interconnection Topology, Abhath Al-Yarmouk, 6, pp. 9-24, (1997)
[9] Ouyang P., Palem K.V., Very efficient cyclic shifts on hypercubes, Proceedings of Symposium on Parallel and Distributed Processing, pp. 556-563, (1991)
[10] Qatawneh M., Embedding linear array onto tree-hypercube network, Eur. J. Sci. Res, 10, (2005)

← 1 2 →