DocumentCode
3497332
Title
Constructing Complete Binary Trees on Petersen-Torus Networks
Author
Jung-hyun, Seo ; HyeongOk, Lee ; Moon-suk, Jang
Author_Institution
Dept. of Comput. Eng., Nat. Univ. of Sunchon, Sunchon
Volume
2
fYear
2008
fDate
11-13 Nov. 2008
Firstpage
252
Lastpage
255
Abstract
In this study, it was proven that the complete binary tree might be embedded in PT(n,n). One-to-one embedding was done at congestion 1, expansion eDot 5, and dilation 3(n+1)/4 + 1 by applying how to construct H-tree in mesh network. The embedding at congestion 1 was appropriate for both store-and-forward routing system and wormhole routing system, and the one-to-one embedding reduced the processor load.
Keywords
multiprocessor interconnection networks; parallel algorithms; telecommunication network routing; trees (mathematics); H-tree; Petersen-Torus network; binary trees; interconnection network; mesh network; parallel algorithm; processor load; store-and-forward routing system; wormhole routing system; Algorithm design and analysis; Binary trees; Computer networks; Costs; Hypercubes; Information technology; Multiprocessor interconnection networks; Parallel algorithms; Routing; Tree graphs; Embedding; Petersen-Torus; complete binary tree; interconnection network;
fLanguage
English
Publisher
ieee
Conference_Titel
Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference on
Conference_Location
Busan
Print_ISBN
978-0-7695-3407-7
Type
conf
DOI
10.1109/ICCIT.2008.54
Filename
4682249
Link To Document