The Tree Machine Operating System
- Creators
- Li, Pey-yun Peggy
Abstract
The tree machine has been well defined as a concurrent computing system by Sally Browning & Carver Mead [1]. 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.
Attached Files
Submitted - TM_4618.pdf
Files
Name | Size | Download all |
---|---|---|
md5:ae09e534d8ea8a99eb42b4786cb51885
|
7.5 MB | Preview Download |
Additional details
- Eprint ID
- 30157
- Resolver ID
- CaltechAUTHORS:20120418-101642081
- Created
-
2012-04-18Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Memorandum
- Series Volume or Issue Number
- 1981.4618