On context streams and the boundedness of context flow graphs:
Abstract: "Context Flow (CF) [TOI88] is an architectural paradigm in which process contexts rather than process data are manipulated. In this report, we define the state of a CF computation as the context stream which passes a particular point in a context flow graph during a given period of ti...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1990
|
| Schriftenreihe: | University <Edinburgh> / Department of Computer Science: CSR
2 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Context Flow (CF) [TOI88] is an architectural paradigm in which process contexts rather than process data are manipulated. In this report, we define the state of a CF computation as the context stream which passes a particular point in a context flow graph during a given period of time. Using the notion of a context stream, we re-define a context flow graph as a function on streams. We show that for a class of context flow graph corresponding to dynamic multifunctional pipelines, the number of contexts which may exist at any point in a graph is bounded, and independent of the computation being performed This result shows that we can implement such a pipeline in context flow without the need for interlocks between stages. |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010437261 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951023s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24327342 | ||
| 035 | |a (DE-599)BVBBV010437261 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Lees, Timothy |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On context streams and the boundedness of context flow graphs |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Computer Science: CSR |v 2 | |
| 520 | 3 | |a Abstract: "Context Flow (CF) [TOI88] is an architectural paradigm in which process contexts rather than process data are manipulated. In this report, we define the state of a CF computation as the context stream which passes a particular point in a context flow graph during a given period of time. Using the notion of a context stream, we re-define a context flow graph as a function on streams. We show that for a class of context flow graph corresponding to dynamic multifunctional pipelines, the number of contexts which may exist at any point in a graph is bounded, and independent of the computation being performed | |
| 520 | 3 | |a This result shows that we can implement such a pipeline in context flow without the need for interlocks between stages. | |
| 650 | 7 | |a Computer hardware |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Graph theory | |
| 810 | 2 | |a Department of Computer Science: CSR |t University <Edinburgh> |v 2 |w (DE-604)BV008906637 |9 2 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006955592 | ||
Datensatz im Suchindex
| _version_ | 1804124870877904896 |
|---|---|
| any_adam_object | |
| author | Lees, Timothy |
| author_facet | Lees, Timothy |
| author_role | aut |
| author_sort | Lees, Timothy |
| author_variant | t l tl |
| building | Verbundindex |
| bvnumber | BV010437261 |
| ctrlnum | (OCoLC)24327342 (DE-599)BVBBV010437261 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01705nam a2200325 cb4500</leader><controlfield tag="001">BV010437261</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951023s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24327342</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010437261</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="100" ind1="1" ind2=" "><subfield code="a">Lees, Timothy</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On context streams and the boundedness of context flow graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Computer Science: CSR</subfield><subfield code="v">2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Context Flow (CF) [TOI88] is an architectural paradigm in which process contexts rather than process data are manipulated. In this report, we define the state of a CF computation as the context stream which passes a particular point in a context flow graph during a given period of time. Using the notion of a context stream, we re-define a context flow graph as a function on streams. We show that for a class of context flow graph corresponding to dynamic multifunctional pipelines, the number of contexts which may exist at any point in a graph is bounded, and independent of the computation being performed</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This result shows that we can implement such a pipeline in context flow without the need for interlocks between stages.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer hardware</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: CSR</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">2</subfield><subfield code="w">(DE-604)BV008906637</subfield><subfield code="9">2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006955592</subfield></datafield></record></collection> |
| id | DE-604.BV010437261 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006955592 |
| oclc_num | 24327342 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Computer Science: CSR |
| spelling | Lees, Timothy Verfasser aut On context streams and the boundedness of context flow graphs Edinburgh 1990 16 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Computer Science: CSR 2 Abstract: "Context Flow (CF) [TOI88] is an architectural paradigm in which process contexts rather than process data are manipulated. In this report, we define the state of a CF computation as the context stream which passes a particular point in a context flow graph during a given period of time. Using the notion of a context stream, we re-define a context flow graph as a function on streams. We show that for a class of context flow graph corresponding to dynamic multifunctional pipelines, the number of contexts which may exist at any point in a graph is bounded, and independent of the computation being performed This result shows that we can implement such a pipeline in context flow without the need for interlocks between stages. Computer hardware sigle Computer software sigle Graph theory Department of Computer Science: CSR University <Edinburgh> 2 (DE-604)BV008906637 2 |
| spellingShingle | Lees, Timothy On context streams and the boundedness of context flow graphs Computer hardware sigle Computer software sigle Graph theory |
| title | On context streams and the boundedness of context flow graphs |
| title_auth | On context streams and the boundedness of context flow graphs |
| title_exact_search | On context streams and the boundedness of context flow graphs |
| title_full | On context streams and the boundedness of context flow graphs |
| title_fullStr | On context streams and the boundedness of context flow graphs |
| title_full_unstemmed | On context streams and the boundedness of context flow graphs |
| title_short | On context streams and the boundedness of context flow graphs |
| title_sort | on context streams and the boundedness of context flow graphs |
| topic | Computer hardware sigle Computer software sigle Graph theory |
| topic_facet | Computer hardware Computer software Graph theory |
| volume_link | (DE-604)BV008906637 |
| work_keys_str_mv | AT leestimothy oncontextstreamsandtheboundednessofcontextflowgraphs |