General theory relating to the implentation of concurrent symbolic computation:
Abstract: "The central result of this work is the discovery of a new class of architectures, which I call D-RISC, sharing some characterisctics of both data flow and von Neumann RISC computers, for concurrent computation. This rests on an original and simple theory which relates the demands of...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge
1989
|
Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
174 |
Schlagworte: | |
Zusammenfassung: | Abstract: "The central result of this work is the discovery of a new class of architectures, which I call D-RISC, sharing some characterisctics of both data flow and von Neumann RISC computers, for concurrent computation. This rests on an original and simple theory which relates the demands of concurrent computation on hardware resources to the fundamental performance constraints of technology. I show that dataflow and von Neumann architecture have different fundamental hardware constraints to performance, and that therefore a D-RISC architecture, which balances these two constraints, is likely to be optimum for concurrent computation. The work forms four related section 1) A study of the nature of concurrent symbolic computation and the demands which it makes from any implentation. Two new results emerge from this. A model of computation which will be used extensively in subsequent sections and a way of incorporating imperative updates in a functional language, similar but superior to non-deterministic merge, which captures locally sequential updates in a computation with minimum constraint on global concurrency. 2) The computational model is used to contrast different policies for localising data near a CPU. A new type of cache is proposed which renames all of its cached addresses in order to reduce CPU wordlength 3) CPU design is examined and a new class of architectures for concurrent computation, called D-RISCs, are proposed. 4) The multiple-thread implementation problems encountered in the new architectures are examined. A new analysis of the relationship between scheduling and intermediate store use in a symbolic concurrent computation is presented. |
Beschreibung: | Zugl.: Cambridge, Univ., Diss. |
Beschreibung: | III, 113 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV004159194 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 901119s1989 d||| m||| 00||| eng d | ||
035 | |a (OCoLC)20796926 | ||
035 | |a (DE-599)BVBBV004159194 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
084 | |a DAT 702d |2 stub | ||
100 | 1 | |a Clarke, Thomas J. |e Verfasser |4 aut | |
245 | 1 | 0 | |a General theory relating to the implentation of concurrent symbolic computation |c by Thomas James Woodchurch Clarke |
264 | 1 | |a Cambridge |c 1989 | |
300 | |a III, 113 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 174 | |
500 | |a Zugl.: Cambridge, Univ., Diss. | ||
520 | 3 | |a Abstract: "The central result of this work is the discovery of a new class of architectures, which I call D-RISC, sharing some characterisctics of both data flow and von Neumann RISC computers, for concurrent computation. This rests on an original and simple theory which relates the demands of concurrent computation on hardware resources to the fundamental performance constraints of technology. I show that dataflow and von Neumann architecture have different fundamental hardware constraints to performance, and that therefore a D-RISC architecture, which balances these two constraints, is likely to be optimum for concurrent computation. The work forms four related section | |
520 | 3 | |a 1) A study of the nature of concurrent symbolic computation and the demands which it makes from any implentation. Two new results emerge from this. A model of computation which will be used extensively in subsequent sections and a way of incorporating imperative updates in a functional language, similar but superior to non-deterministic merge, which captures locally sequential updates in a computation with minimum constraint on global concurrency. 2) The computational model is used to contrast different policies for localising data near a CPU. A new type of cache is proposed which renames all of its cached addresses in order to reduce CPU wordlength | |
520 | 3 | |a 3) CPU design is examined and a new class of architectures for concurrent computation, called D-RISCs, are proposed. 4) The multiple-thread implementation problems encountered in the new architectures are examined. A new analysis of the relationship between scheduling and intermediate store use in a symbolic concurrent computation is presented. | |
650 | 7 | |a Computer hardware |2 sigle | |
650 | 7 | |a Computer software |2 sigle | |
650 | 7 | |a Information theory |2 sigle | |
650 | 4 | |a Computer architecture | |
650 | 4 | |a Parallel processing (Electronic computers) | |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 174 |w (DE-604)BV004055605 |9 174 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-002593865 |
Datensatz im Suchindex
_version_ | 1804118370991210496 |
---|---|
any_adam_object | |
author | Clarke, Thomas J. |
author_facet | Clarke, Thomas J. |
author_role | aut |
author_sort | Clarke, Thomas J. |
author_variant | t j c tj tjc |
building | Verbundindex |
bvnumber | BV004159194 |
classification_tum | DAT 702d |
ctrlnum | (OCoLC)20796926 (DE-599)BVBBV004159194 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02956nam a2200385 cb4500</leader><controlfield tag="001">BV004159194</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">901119s1989 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20796926</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004159194</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="084" ind1=" " ind2=" "><subfield code="a">DAT 702d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clarke, Thomas J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">General theory relating to the implentation of concurrent symbolic computation</subfield><subfield code="c">by Thomas James Woodchurch Clarke</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">III, 113 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="490" ind1="1" ind2=" "><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">174</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Cambridge, Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The central result of this work is the discovery of a new class of architectures, which I call D-RISC, sharing some characterisctics of both data flow and von Neumann RISC computers, for concurrent computation. This rests on an original and simple theory which relates the demands of concurrent computation on hardware resources to the fundamental performance constraints of technology. I show that dataflow and von Neumann architecture have different fundamental hardware constraints to performance, and that therefore a D-RISC architecture, which balances these two constraints, is likely to be optimum for concurrent computation. The work forms four related section</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">1) A study of the nature of concurrent symbolic computation and the demands which it makes from any implentation. Two new results emerge from this. A model of computation which will be used extensively in subsequent sections and a way of incorporating imperative updates in a functional language, similar but superior to non-deterministic merge, which captures locally sequential updates in a computation with minimum constraint on global concurrency. 2) The computational model is used to contrast different policies for localising data near a CPU. A new type of cache is proposed which renames all of its cached addresses in order to reduce CPU wordlength</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">3) CPU design is examined and a new class of architectures for concurrent computation, called D-RISCs, are proposed. 4) The multiple-thread implementation problems encountered in the new architectures are examined. A new analysis of the relationship between scheduling and intermediate store use in a symbolic concurrent computation is presented.</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="7"><subfield code="a">Information theory</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</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="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">174</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">174</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002593865</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV004159194 |
illustrated | Illustrated |
indexdate | 2024-07-09T16:09:14Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002593865 |
oclc_num | 20796926 |
open_access_boolean | |
physical | III, 113 S. graph. Darst. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
record_format | marc |
series | Computer Laboratory <Cambridge>: Technical report |
series2 | Computer Laboratory <Cambridge>: Technical report |
spelling | Clarke, Thomas J. Verfasser aut General theory relating to the implentation of concurrent symbolic computation by Thomas James Woodchurch Clarke Cambridge 1989 III, 113 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 174 Zugl.: Cambridge, Univ., Diss. Abstract: "The central result of this work is the discovery of a new class of architectures, which I call D-RISC, sharing some characterisctics of both data flow and von Neumann RISC computers, for concurrent computation. This rests on an original and simple theory which relates the demands of concurrent computation on hardware resources to the fundamental performance constraints of technology. I show that dataflow and von Neumann architecture have different fundamental hardware constraints to performance, and that therefore a D-RISC architecture, which balances these two constraints, is likely to be optimum for concurrent computation. The work forms four related section 1) A study of the nature of concurrent symbolic computation and the demands which it makes from any implentation. Two new results emerge from this. A model of computation which will be used extensively in subsequent sections and a way of incorporating imperative updates in a functional language, similar but superior to non-deterministic merge, which captures locally sequential updates in a computation with minimum constraint on global concurrency. 2) The computational model is used to contrast different policies for localising data near a CPU. A new type of cache is proposed which renames all of its cached addresses in order to reduce CPU wordlength 3) CPU design is examined and a new class of architectures for concurrent computation, called D-RISCs, are proposed. 4) The multiple-thread implementation problems encountered in the new architectures are examined. A new analysis of the relationship between scheduling and intermediate store use in a symbolic concurrent computation is presented. Computer hardware sigle Computer software sigle Information theory sigle Computer architecture Parallel processing (Electronic computers) (DE-588)4113937-9 Hochschulschrift gnd-content Computer Laboratory <Cambridge>: Technical report 174 (DE-604)BV004055605 174 |
spellingShingle | Clarke, Thomas J. General theory relating to the implentation of concurrent symbolic computation Computer Laboratory <Cambridge>: Technical report Computer hardware sigle Computer software sigle Information theory sigle Computer architecture Parallel processing (Electronic computers) |
subject_GND | (DE-588)4113937-9 |
title | General theory relating to the implentation of concurrent symbolic computation |
title_auth | General theory relating to the implentation of concurrent symbolic computation |
title_exact_search | General theory relating to the implentation of concurrent symbolic computation |
title_full | General theory relating to the implentation of concurrent symbolic computation by Thomas James Woodchurch Clarke |
title_fullStr | General theory relating to the implentation of concurrent symbolic computation by Thomas James Woodchurch Clarke |
title_full_unstemmed | General theory relating to the implentation of concurrent symbolic computation by Thomas James Woodchurch Clarke |
title_short | General theory relating to the implentation of concurrent symbolic computation |
title_sort | general theory relating to the implentation of concurrent symbolic computation |
topic | Computer hardware sigle Computer software sigle Information theory sigle Computer architecture Parallel processing (Electronic computers) |
topic_facet | Computer hardware Computer software Information theory Computer architecture Parallel processing (Electronic computers) Hochschulschrift |
volume_link | (DE-604)BV004055605 |
work_keys_str_mv | AT clarkethomasj generaltheoryrelatingtotheimplentationofconcurrentsymboliccomputation |