The Tree Machine: A Highly Concurrent Computing Environment

Author: Browning, Sally Anne

Year: 1980

Degree: Dissertation (Ph.D.)

Advisor: Mead, Carver

Committee Member: Unknown, Unknown

Option: Computer Science

DOI: 10.7907/15zs-9x82

Abstract

An architecture for a VLSI multiprocessor machine is proposed. The processors are connected together as a binary tree. A collection of algorithms are mapped onto the tree machine. These include heap sort transitive closure, the travelling salesman, and matrix inversion, among others. A model of computational complexity for the tree machine is suggested, and the algorithms are analyzed in the context of that model. A notation for expressing the algorithms is described, a processor design is proposed, and a compiler for the notation and processor is presented.

Files