DocumentCode
1950277
Title
Compressed tree machines
Author
Zheng, Si-Qing
Author_Institution
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
fYear
1990
fDate
21-23 Mar 1990
Firstpage
907
Abstract
Summary form only given. The problem of reducing the cost of a multiprocessor system without losing system efficiency is investigated. The author proposes a simplified tree architecture, called the compressed tree machine. For computation intensive applications, the author presents a simple load balancing method for compressed tree machines which guarantees the optimal simulation of tree machines in terms of the speed and number of processors
Keywords
automata theory; multiprocessor interconnection networks; parallel architectures; trees (mathematics); compressed tree machines; computation intensive applications; load balancing; Algorithm design and analysis; Binary trees; Broadcasting; Circuits; Computer architecture; Computer science; Costs; Data communication; Parallel algorithms; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1990. Conference Proceedings., Ninth Annual International Phoenix Conference on
Conference_Location
Scottsdale, AZ
Print_ISBN
0-8186-2030-7
Type
conf
DOI
10.1109/PCCC.1990.101745
Filename
101745
Link To Document