By Topic

Tr-machine architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. M. George ; Dept. of Comput. Sci., Oklahoma State Univ., Stillwater, OK, USA ; J. Duan

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

Published in:

Massively Parallel Computing Systems, 1994., Proceedings of the First International Conference on

Date of Conference:

2-6 May 1994