Reference tree networks: virtual machine and implementation
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 spe...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1979
|
| Schlagworte: | |
| Zusammenfassung: | 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). |
| Beschreibung: | Zugl.: Diss. |
| Beschreibung: | 252 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021875861 | ||
| 003 | DE-604 | ||
| 005 | 20060630000000.0 | ||
| 007 | t | ||
| 008 | 880222s1979 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227427698 | ||
| 035 | |a (DE-599)BVBBV021875861 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-222 | ||
| 100 | 1 | |a Halstead, Robert H. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Reference tree networks |b virtual machine and implementation |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1979 | |
| 300 | |a 252 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Zugl.: Diss. | ||
| 520 | 3 | |a 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). | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computer Systems |2 scgdst | |
| 650 | 7 | |a Data links |2 dtict | |
| 650 | 7 | |a Data processing |2 dtict | |
| 650 | 7 | |a Human Factors Engineering & Man Machine System |2 scgdst | |
| 650 | 7 | |a Information processing |2 dtict | |
| 650 | 7 | |a Man computer interface |2 dtict | |
| 650 | 7 | |a Memory devices |2 dtict | |
| 650 | 7 | |a Message processing |2 dtict | |
| 650 | 7 | |a Networks |2 dtict | |
| 650 | 7 | |a Parallel processing |2 dtict | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 0 | 7 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenflussarchitektur |0 (DE-588)4247883-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Virtuelle Maschine |0 (DE-588)4188396-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Virtuelle Maschine |0 (DE-588)4188396-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Datenflussarchitektur |0 (DE-588)4247883-2 |D s |
| 689 | 2 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091505 | ||
Datensatz im Suchindex
| _version_ | 1804135815238909952 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Halstead, Robert H. |
| author_facet | Halstead, Robert H. |
| author_role | aut |
| author_sort | Halstead, Robert H. |
| author_variant | r h h rh rhh |
| building | Verbundindex |
| bvnumber | BV021875861 |
| ctrlnum | (OCoLC)227427698 (DE-599)BVBBV021875861 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03209nam a2200541zc 4500</leader><controlfield tag="001">BV021875861</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060630000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880222s1979 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227427698</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021875861</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-222</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Halstead, Robert H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reference tree networks</subfield><subfield code="b">virtual machine and implementation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">252 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Systems</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data links</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Human Factors Engineering & Man Machine System</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Man computer interface</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Memory devices</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Message processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Networks</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallel processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenflussarchitektur</subfield><subfield code="0">(DE-588)4247883-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Virtuelle Maschine</subfield><subfield code="0">(DE-588)4188396-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Virtuelle Maschine</subfield><subfield code="0">(DE-588)4188396-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Datenflussarchitektur</subfield><subfield code="0">(DE-588)4247883-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091505</subfield></datafield></record></collection> |
| id | DE-604.BV021875861 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:35Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091505 |
| oclc_num | 227427698 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 252 S. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Halstead, Robert H. Verfasser aut Reference tree networks virtual machine and implementation Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1979 252 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Diss. 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). Algorithms dtict Computer Hardware scgdst Computer Systems scgdst Data links dtict Data processing dtict Human Factors Engineering & Man Machine System scgdst Information processing dtict Man computer interface dtict Memory devices dtict Message processing dtict Networks dtict Parallel processing dtict Datenverarbeitung Mehrprozessorsystem (DE-588)4038397-0 gnd rswk-swf Datenflussarchitektur (DE-588)4247883-2 gnd rswk-swf Virtuelle Maschine (DE-588)4188396-2 gnd rswk-swf Mehrprozessorsystem (DE-588)4038397-0 s DE-604 Virtuelle Maschine (DE-588)4188396-2 s Datenflussarchitektur (DE-588)4247883-2 s |
| spellingShingle | Halstead, Robert H. Reference tree networks virtual machine and implementation Algorithms dtict Computer Hardware scgdst Computer Systems scgdst Data links dtict Data processing dtict Human Factors Engineering & Man Machine System scgdst Information processing dtict Man computer interface dtict Memory devices dtict Message processing dtict Networks dtict Parallel processing dtict Datenverarbeitung Mehrprozessorsystem (DE-588)4038397-0 gnd Datenflussarchitektur (DE-588)4247883-2 gnd Virtuelle Maschine (DE-588)4188396-2 gnd |
| subject_GND | (DE-588)4038397-0 (DE-588)4247883-2 (DE-588)4188396-2 |
| title | Reference tree networks virtual machine and implementation |
| title_auth | Reference tree networks virtual machine and implementation |
| title_exact_search | Reference tree networks virtual machine and implementation |
| title_exact_search_txtP | Reference tree networks virtual machine and implementation |
| title_full | Reference tree networks virtual machine and implementation |
| title_fullStr | Reference tree networks virtual machine and implementation |
| title_full_unstemmed | Reference tree networks virtual machine and implementation |
| title_short | Reference tree networks |
| title_sort | reference tree networks virtual machine and implementation |
| title_sub | virtual machine and implementation |
| topic | Algorithms dtict Computer Hardware scgdst Computer Systems scgdst Data links dtict Data processing dtict Human Factors Engineering & Man Machine System scgdst Information processing dtict Man computer interface dtict Memory devices dtict Message processing dtict Networks dtict Parallel processing dtict Datenverarbeitung Mehrprozessorsystem (DE-588)4038397-0 gnd Datenflussarchitektur (DE-588)4247883-2 gnd Virtuelle Maschine (DE-588)4188396-2 gnd |
| topic_facet | Algorithms Computer Hardware Computer Systems Data links Data processing Human Factors Engineering & Man Machine System Information processing Man computer interface Memory devices Message processing Networks Parallel processing Datenverarbeitung Mehrprozessorsystem Datenflussarchitektur Virtuelle Maschine |
| work_keys_str_mv | AT halsteadroberth referencetreenetworksvirtualmachineandimplementation |