DocumentCode
2369448
Title
Tr-machine architecture
Author
George, K.M. ; Duan, Juan
Author_Institution
Dept. of Comput. Sci., Oklahoma State Univ., Stillwater, OK, USA
fYear
1994
fDate
2-6 May 1994
Firstpage
191
Lastpage
195
Abstract
In this paper we describe a new parallel computer architecture called Tr-machine. Tr-machine instruction set architecture combines reduction with traditional approaches. The architecture uses two types of processing units and a tree structured organized as a balanced tree. The leaf nodes are called C-nodes and they perform the computation. The internal nodes are called S-nodes. The S-nodes facilitate communication and keep track of different parallel computations
Keywords
parallel architectures; reconfigurable architectures; S-nodes; Tr-machine; balanced tree; parallel computer architecture; scalable parallel machine; Computational modeling; Computer architecture; Computer languages; Computer science; Concurrent computing; Data flow computing; Magnetic heads; Parallel architectures; Parallel processing; Tail;
fLanguage
English
Publisher
ieee
Conference_Titel
Massively Parallel Computing Systems, 1994., Proceedings of the First International Conference on
Conference_Location
Ischia
Print_ISBN
0-8186-6322-7
Type
conf
DOI
10.1109/MPCS.1994.367079
Filename
367079
Link To Document