Li, Pey-yun Peggy (1981) The Tree Machine Operating System. California Institute of Technology , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechAUTHORS:20120418-101642081
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120418-101642081
The tree machine has been well defined as a concurrent computing system by Sally Browning & Carver Mead . Many algorithms have been developed and shown to have better time-performance than conventional sequential algorithms. And since a tree machine is being built and is expected to become operational within a year, a real tree machine (not just a mathematical model or some pieces of hardware) is about to face the world. This report is treating the bridging between the mathematical model and the hardware machine to make the Tree Machine become real! In the following sections, I will describe the hardware structure of the tree machine processors, the software structure of the machine operating system, the detailed description of the assembler, the loader and the simulator. Some of the tree machine algorithms have been tested under this software system. Some performance evaluation is presented in the last section.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Computer Science Technical Reports|
|Other Numbering System:|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Kristin Buxton|
|Deposited On:||18 Apr 2012 17:53|
|Last Modified:||26 Dec 2012 15:04|
Repository Staff Only: item control page