DocumentCode :
3204850
Title :
Generalized compressed tree machines
Author :
Gupta, Ajay ; Wang, Hong
Author_Institution :
Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA
fYear :
1992
fDate :
23-26 Mar 1992
Firstpage :
95
Lastpage :
102
Abstract :
Parallel machines interconnecting up to thousands of processors have been proposed and recently built. One of the earliest and the most prominent one is a complete binary tree machine. The authors propose a family of tree machines called generalized compressed tree machines. Generalized compressed tree machines may, in general, be viewed as a derivative of the complete binary tree networks
Keywords :
automata theory; parallel processing; binary tree machine; generalized compressed tree machines; parallel machines; tree machines; Algorithm design and analysis; Binary trees; Computer science; Hypercubes; Metalworking machines; Parallel algorithms; Parallel machines; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location :
Beverly Hills, CA
Print_ISBN :
0-8186-2672-0
Type :
conf
DOI :
10.1109/IPPS.1992.223065
Filename :
223065
Link To Document :
بازگشت