CaltechTHESIS
  A Caltech Library Service

The tree machine : a highly concurrent computing environment

Citation

Browning, Sally A. (1980) The tree machine : a highly concurrent computing environment. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-12082006-153626

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.

Item Type:Thesis (Dissertation (Ph.D.))
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Computer Science
Thesis Availability:Restricted to Caltech community only
Research Advisor(s):
  • Mead, Carver
Thesis Committee:
  • Unknown, Unknown
Defense Date:15 January 1980
Record Number:CaltechETD:etd-12082006-153626
Persistent URL:http://resolver.caltech.edu/CaltechETD:etd-12082006-153626
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:4871
Collection:CaltechTHESIS
Deposited By: Imported from ETD-db
Deposited On:22 Dec 2006
Last Modified:26 Dec 2012 03:12

Thesis Files

[img] PDF (Browning_sa_1980.pdf) - Final Version
Restricted to Caltech community only
See Usage Policy.

27Mb

Repository Staff Only: item control page