Dataflow computation for the J-machine:
Abstract: "The dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction-level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a 'hybrid' model o...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
[Cambridge, Mass.]
MIT Artificial Intelligence Laboratory
1990
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction-level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a 'hybrid' model of computation where regions of dataflow graphs are combined into sequential blocks of code. I have implemented such a system to allow the J-Machine to run Id programs, leaving exposed a high amount of parallelism -- such as among loop iterations. I describe this system and provide an analysis of its strengths and weaknesses and those of the J-Machine, along with ideas for improvement." |
| Beschreibung: | VIII, 129 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV005425169 | ||
| 003 | DE-604 | ||
| 005 | 20080903 | ||
| 007 | t | ||
| 008 | 920701s1990 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)24875343 | ||
| 035 | |a (DE-599)BVBBV005425169 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 314d |2 stub | ||
| 084 | |a DAT 383d |2 stub | ||
| 084 | |a DAT 216d |2 stub | ||
| 084 | |a DAT 265d |2 stub | ||
| 088 | |a AI TR 1233 | ||
| 100 | 1 | |a Spertus, Ellen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Dataflow computation for the J-machine |
| 246 | 1 | 3 | |a AI TR 1233 |
| 264 | 1 | |a [Cambridge, Mass.] |b MIT Artificial Intelligence Laboratory |c 1990 | |
| 300 | |a VIII, 129 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Abstract: "The dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction-level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a 'hybrid' model of computation where regions of dataflow graphs are combined into sequential blocks of code. I have implemented such a system to allow the J-Machine to run Id programs, leaving exposed a high amount of parallelism -- such as among loop iterations. I describe this system and provide an analysis of its strengths and weaknesses and those of the J-Machine, along with ideas for improvement." | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003392355 | ||
Datensatz im Suchindex
| _version_ | 1804119633005903872 |
|---|---|
| any_adam_object | |
| author | Spertus, Ellen |
| author_facet | Spertus, Ellen |
| author_role | aut |
| author_sort | Spertus, Ellen |
| author_variant | e s es |
| building | Verbundindex |
| bvnumber | BV005425169 |
| classification_tum | DAT 314d DAT 383d DAT 216d DAT 265d |
| ctrlnum | (OCoLC)24875343 (DE-599)BVBBV005425169 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01752nam a2200373 c 4500</leader><controlfield tag="001">BV005425169</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080903 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">920701s1990 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24875343</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005425169</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 314d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 383d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 216d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 265d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">AI TR 1233</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Spertus, Ellen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dataflow computation for the J-machine</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">AI TR 1233</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[Cambridge, Mass.]</subfield><subfield code="b">MIT Artificial Intelligence Laboratory</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 129 S.</subfield><subfield code="b">graph. Darst.</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">Abstract: "The dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction-level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a 'hybrid' model of computation where regions of dataflow graphs are combined into sequential blocks of code. I have implemented such a system to allow the J-Machine to run Id programs, leaving exposed a high amount of parallelism -- such as among loop iterations. I describe this system and provide an analysis of its strengths and weaknesses and those of the J-Machine, along with ideas for improvement."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003392355</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV005425169 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:29:17Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003392355 |
| oclc_num | 24875343 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | VIII, 129 S. graph. Darst. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | MIT Artificial Intelligence Laboratory |
| record_format | marc |
| spelling | Spertus, Ellen Verfasser aut Dataflow computation for the J-machine AI TR 1233 [Cambridge, Mass.] MIT Artificial Intelligence Laboratory 1990 VIII, 129 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Abstract: "The dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction-level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a 'hybrid' model of computation where regions of dataflow graphs are combined into sequential blocks of code. I have implemented such a system to allow the J-Machine to run Id programs, leaving exposed a high amount of parallelism -- such as among loop iterations. I describe this system and provide an analysis of its strengths and weaknesses and those of the J-Machine, along with ideas for improvement." Datenverarbeitung Electronic data processing Parallel programming (Computer science) (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Spertus, Ellen Dataflow computation for the J-machine Datenverarbeitung Electronic data processing Parallel programming (Computer science) |
| subject_GND | (DE-588)4113937-9 |
| title | Dataflow computation for the J-machine |
| title_alt | AI TR 1233 |
| title_auth | Dataflow computation for the J-machine |
| title_exact_search | Dataflow computation for the J-machine |
| title_full | Dataflow computation for the J-machine |
| title_fullStr | Dataflow computation for the J-machine |
| title_full_unstemmed | Dataflow computation for the J-machine |
| title_short | Dataflow computation for the J-machine |
| title_sort | dataflow computation for the j machine |
| topic | Datenverarbeitung Electronic data processing Parallel programming (Computer science) |
| topic_facet | Datenverarbeitung Electronic data processing Parallel programming (Computer science) Hochschulschrift |
| work_keys_str_mv | AT spertusellen dataflowcomputationforthejmachine AT spertusellen aitr1233 |