DocumentCode :
3438658
Title :
Congestion-free dilation-2 embedding of full binary trees on star graphs
Author :
Saikia, D.K. ; Badrinath, R. ; Sen, R.K.
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India
fYear :
1996
fDate :
19-22 Dec 1996
Firstpage :
152
Lastpage :
157
Abstract :
In this paper we present a scheme for congestion-free embedding of full binary trees on a star graph. The height of the tree that can be embedded with this scheme in an n-star is (n+1)[log2n]-2[log2n]+1+1. The dilation of the embedding is two. This is an improvement by a factor of two over an earlier result
Keywords :
computational complexity; multiprocessor interconnection networks; tree data structures; binary trees; congestion-free embedding; dilation-2 embedding; full binary trees; star graph; Binary trees; Computational modeling; Computer science; Flyback transformers; Hypercubes; Multiprocessor interconnection networks; Parallel algorithms; Parallel processing; Tin; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Computing, 1996. Proceedings. 3rd International Conference on
Conference_Location :
Trivandrum
Print_ISBN :
0-8186-7557-8
Type :
conf
DOI :
10.1109/HIPC.1996.565815
Filename :
565815
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3438658
بازگشت