Resource management for the tagged token dataflow architecture:
The Taged Token Dataflow Architecture is multiprocessor based on the U-interpreter model of dataflow computation. It captures the essential execution mechhanism of the U-interpreter precisely; operations are enabled for execution by the availability of operand data. However, computational resources...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1985
|
Schlagworte: | |
Zusammenfassung: | The Taged Token Dataflow Architecture is multiprocessor based on the U-interpreter model of dataflow computation. It captures the essential execution mechhanism of the U-interpreter precisely; operations are enabled for execution by the availability of operand data. However, computational resources in the model and the machine are viewed quite differently. This thesis addresses four major resource management issues essential to bridge the gap between the U-interpreter and the Tagged Token Dataflow Architecture: Termination detection; Token store overflow; Iteration identifier overflow; and Program deadlock. This thesis offers a way to overcome the differences between the model and the machine through a concerted approach to resource management, involving the compiler and the run-time system. Program graphs based on the U-interpreter model is transformed into equivalent graphs which are more suitable for execution on the Tagged Token Dataflow Architecture, These graphs have predictable resource requirements and include special operations to engage the run-time system. The run-time system has two responsibilities: dynamic allocation/deallocation of resources, and dynamic control of program execution. The work presented here is motivated by the need to however, it serves a more general goal as well. Resource management is a fundamental aspect of any dataflow machine, and the issues raised in this thesis should have a prominent role in the design and evaluation of dataflow architectures in general. |
Beschreibung: | 116 S. |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV021891539 | ||
003 | DE-604 | ||
005 | 20040301000000.0 | ||
007 | t | ||
008 | 900703s1985 |||| 00||| eng d | ||
035 | |a (OCoLC)227646233 | ||
035 | |a (DE-599)BVBBV021891539 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
088 | |a MIT/LCS/TR-332 | ||
100 | 1 | |a Culler, David E. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Resource management for the tagged token dataflow architecture |
264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1985 | |
300 | |a 116 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
520 | 3 | |a The Taged Token Dataflow Architecture is multiprocessor based on the U-interpreter model of dataflow computation. It captures the essential execution mechhanism of the U-interpreter precisely; operations are enabled for execution by the availability of operand data. However, computational resources in the model and the machine are viewed quite differently. This thesis addresses four major resource management issues essential to bridge the gap between the U-interpreter and the Tagged Token Dataflow Architecture: Termination detection; Token store overflow; Iteration identifier overflow; and Program deadlock. This thesis offers a way to overcome the differences between the model and the machine through a concerted approach to resource management, involving the compiler and the run-time system. Program graphs based on the U-interpreter model is transformed into equivalent graphs which are more suitable for execution on the Tagged Token Dataflow Architecture, These graphs have predictable resource requirements and include special operations to engage the run-time system. The run-time system has two responsibilities: dynamic allocation/deallocation of resources, and dynamic control of program execution. The work presented here is motivated by the need to however, it serves a more general goal as well. Resource management is a fundamental aspect of any dataflow machine, and the issues raised in this thesis should have a prominent role in the design and evaluation of dataflow architectures in general. | |
650 | 7 | |a Compilers |2 dtict | |
650 | 7 | |a Computations |2 dtict | |
650 | 7 | |a Computer Hardware |2 scgdst | |
650 | 7 | |a Computer Programming and Software |2 scgdst | |
650 | 7 | |a Computer architecture |2 dtict | |
650 | 7 | |a Control |2 dtict | |
650 | 7 | |a Detection |2 dtict | |
650 | 7 | |a Dynamics |2 dtict | |
650 | 7 | |a Graphs |2 dtict | |
650 | 7 | |a Interpreters |2 dtict | |
650 | 7 | |a Multiprocessors |2 dtict | |
650 | 7 | |a Predictions |2 dtict | |
650 | 7 | |a Requirements |2 dtict | |
650 | 7 | |a Resource management |2 dtict | |
650 | 7 | |a Theses |2 dtict | |
650 | 7 | |a Time |2 dtict | |
650 | 0 | 7 | |a Ressourcenmanagement |0 (DE-588)4431979-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Datenflussarchitektur |0 (DE-588)4247883-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Datenfluss |0 (DE-588)4191571-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Interpretierer |0 (DE-588)4162129-3 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Interpretierer |0 (DE-588)4162129-3 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Datenfluss |0 (DE-588)4191571-9 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Datenflussarchitektur |0 (DE-588)4247883-2 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Ressourcenmanagement |0 (DE-588)4431979-4 |D s |
689 | 3 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015106739 |
Datensatz im Suchindex
_version_ | 1804135834899709952 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Culler, David E. |
author_facet | Culler, David E. |
author_role | aut |
author_sort | Culler, David E. |
author_variant | d e c de dec |
building | Verbundindex |
bvnumber | BV021891539 |
ctrlnum | (OCoLC)227646233 (DE-599)BVBBV021891539 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03438nam a2200601zc 4500</leader><controlfield tag="001">BV021891539</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900703s1985 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227646233</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021891539</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-332</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Culler, David E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Resource management for the tagged token dataflow architecture</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">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">116 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="520" ind1="3" ind2=" "><subfield code="a">The Taged Token Dataflow Architecture is multiprocessor based on the U-interpreter model of dataflow computation. It captures the essential execution mechhanism of the U-interpreter precisely; operations are enabled for execution by the availability of operand data. However, computational resources in the model and the machine are viewed quite differently. This thesis addresses four major resource management issues essential to bridge the gap between the U-interpreter and the Tagged Token Dataflow Architecture: Termination detection; Token store overflow; Iteration identifier overflow; and Program deadlock. This thesis offers a way to overcome the differences between the model and the machine through a concerted approach to resource management, involving the compiler and the run-time system. Program graphs based on the U-interpreter model is transformed into equivalent graphs which are more suitable for execution on the Tagged Token Dataflow Architecture, These graphs have predictable resource requirements and include special operations to engage the run-time system. The run-time system has two responsibilities: dynamic allocation/deallocation of resources, and dynamic control of program execution. The work presented here is motivated by the need to however, it serves a more general goal as well. Resource management is a fundamental aspect of any dataflow machine, and the issues raised in this thesis should have a prominent role in the design and evaluation of dataflow architectures in general.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Compilers</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computations</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 Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer architecture</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Control</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Detection</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Dynamics</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Interpreters</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Multiprocessors</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Predictions</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Requirements</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Resource management</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theses</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Time</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ressourcenmanagement</subfield><subfield code="0">(DE-588)4431979-4</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">Datenfluss</subfield><subfield code="0">(DE-588)4191571-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Interpretierer</subfield><subfield code="0">(DE-588)4162129-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Interpretierer</subfield><subfield code="0">(DE-588)4162129-3</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">Datenfluss</subfield><subfield code="0">(DE-588)4191571-9</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="689" ind1="3" ind2="0"><subfield code="a">Ressourcenmanagement</subfield><subfield code="0">(DE-588)4431979-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015106739</subfield></datafield></record></collection> |
id | DE-604.BV021891539 |
illustrated | Not Illustrated |
index_date | 2024-07-02T16:04:11Z |
indexdate | 2024-07-09T20:46:49Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015106739 |
oclc_num | 227646233 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 116 S. |
publishDate | 1985 |
publishDateSearch | 1985 |
publishDateSort | 1985 |
publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
record_format | marc |
spelling | Culler, David E. Verfasser aut Resource management for the tagged token dataflow architecture Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1985 116 S. txt rdacontent n rdamedia nc rdacarrier The Taged Token Dataflow Architecture is multiprocessor based on the U-interpreter model of dataflow computation. It captures the essential execution mechhanism of the U-interpreter precisely; operations are enabled for execution by the availability of operand data. However, computational resources in the model and the machine are viewed quite differently. This thesis addresses four major resource management issues essential to bridge the gap between the U-interpreter and the Tagged Token Dataflow Architecture: Termination detection; Token store overflow; Iteration identifier overflow; and Program deadlock. This thesis offers a way to overcome the differences between the model and the machine through a concerted approach to resource management, involving the compiler and the run-time system. Program graphs based on the U-interpreter model is transformed into equivalent graphs which are more suitable for execution on the Tagged Token Dataflow Architecture, These graphs have predictable resource requirements and include special operations to engage the run-time system. The run-time system has two responsibilities: dynamic allocation/deallocation of resources, and dynamic control of program execution. The work presented here is motivated by the need to however, it serves a more general goal as well. Resource management is a fundamental aspect of any dataflow machine, and the issues raised in this thesis should have a prominent role in the design and evaluation of dataflow architectures in general. Compilers dtict Computations dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer architecture dtict Control dtict Detection dtict Dynamics dtict Graphs dtict Interpreters dtict Multiprocessors dtict Predictions dtict Requirements dtict Resource management dtict Theses dtict Time dtict Ressourcenmanagement (DE-588)4431979-4 gnd rswk-swf Datenflussarchitektur (DE-588)4247883-2 gnd rswk-swf Datenfluss (DE-588)4191571-9 gnd rswk-swf Interpretierer (DE-588)4162129-3 gnd rswk-swf Interpretierer (DE-588)4162129-3 s DE-604 Datenfluss (DE-588)4191571-9 s Datenflussarchitektur (DE-588)4247883-2 s Ressourcenmanagement (DE-588)4431979-4 s |
spellingShingle | Culler, David E. Resource management for the tagged token dataflow architecture Compilers dtict Computations dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer architecture dtict Control dtict Detection dtict Dynamics dtict Graphs dtict Interpreters dtict Multiprocessors dtict Predictions dtict Requirements dtict Resource management dtict Theses dtict Time dtict Ressourcenmanagement (DE-588)4431979-4 gnd Datenflussarchitektur (DE-588)4247883-2 gnd Datenfluss (DE-588)4191571-9 gnd Interpretierer (DE-588)4162129-3 gnd |
subject_GND | (DE-588)4431979-4 (DE-588)4247883-2 (DE-588)4191571-9 (DE-588)4162129-3 |
title | Resource management for the tagged token dataflow architecture |
title_auth | Resource management for the tagged token dataflow architecture |
title_exact_search | Resource management for the tagged token dataflow architecture |
title_exact_search_txtP | Resource management for the tagged token dataflow architecture |
title_full | Resource management for the tagged token dataflow architecture |
title_fullStr | Resource management for the tagged token dataflow architecture |
title_full_unstemmed | Resource management for the tagged token dataflow architecture |
title_short | Resource management for the tagged token dataflow architecture |
title_sort | resource management for the tagged token dataflow architecture |
topic | Compilers dtict Computations dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer architecture dtict Control dtict Detection dtict Dynamics dtict Graphs dtict Interpreters dtict Multiprocessors dtict Predictions dtict Requirements dtict Resource management dtict Theses dtict Time dtict Ressourcenmanagement (DE-588)4431979-4 gnd Datenflussarchitektur (DE-588)4247883-2 gnd Datenfluss (DE-588)4191571-9 gnd Interpretierer (DE-588)4162129-3 gnd |
topic_facet | Compilers Computations Computer Hardware Computer Programming and Software Computer architecture Control Detection Dynamics Graphs Interpreters Multiprocessors Predictions Requirements Resource management Theses Time Ressourcenmanagement Datenflussarchitektur Datenfluss Interpretierer |
work_keys_str_mv | AT cullerdavide resourcemanagementforthetaggedtokendataflowarchitecture |