Citation
Browning, Sally Anne (1980) The Tree Machine: A Highly Concurrent Computing Environment. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/15zs-9x82. https://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.)) | ||||||
|---|---|---|---|---|---|---|---|
| Subject Keywords: | Computer Science | ||||||
| Degree Grantor: | California Institute of Technology | ||||||
| Division: | Engineering and Applied Science | ||||||
| Major Option: | Computer Science | ||||||
| Thesis Availability: | Public (worldwide access) | ||||||
| Research Advisor(s): |
| ||||||
| Thesis Committee: |
| ||||||
| Defense Date: | 15 January 1980 | ||||||
| Record Number: | CaltechETD:etd-12082006-153626 | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechETD:etd-12082006-153626 | ||||||
| DOI: | 10.7907/15zs-9x82 | ||||||
| Related URLs: |
| ||||||
| 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: | 27 Aug 2024 22:27 |
Thesis Files
![[img]](https://thesis.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF (Browning_sa_1980.pdf)
- Final Version
See Usage Policy. 28MB |
Repository Staff Only: item control page
