Reference Tree Networks: Virtual Machine and Implementation.
Abstract
A current-technology computing machine may be roughly decomposed into a processor, a memory, and a data path connecting them. The interposition of this data path between processing and storage elements creates a bottleneck, which inhibits progress at the high-performance end of the technological spectrum. Additionally, the monolithic nature of present-day processors resists incremental addition or removal of processing power. The research described here attacks the problem of constructing more powerful and more flexible computer systems along three fronts: the definition of a virtual machine providing for parallel computation using objects and object references, the development of a distributed implementation mechanism ('reference trees') supporting object management functions including garbage collection, and the investigation of scheduling algorithms and collection of performance results. A reference tree network using theses concepts is composed of a multiple of independent small processors, yet operates as a coherent programming system. Programs and data spread automatically and transparently through the network to occupy underused resources. The modular structure of the network provides many parallel data paths as well as allowing for easy addition or removal of modules, thus addressing some of the problems discussed here. A prototype reference tree network, the MuNer, is currently in operation. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 02, 1979
- Accession Number
- ADA076570
Entities
People
- Robert Hunter Halstead Jr
Organizations
- Massachusetts Institute of Technology