Shared resources for multiple instruction stream pipelined processors:
This research has centered on the performance of functional resources that are used by a single multiple-stream pipelined processor. Such resources include arithmetic functional units and the modules that compose an interleaved memory. The functional requirements of such resources is that they perfo...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Mikrofilm Buch |
Sprache: | English |
Veröffentlicht: |
1979
|
Ausgabe: | [Mikrofiche-Ausg.] |
Schlagworte: | |
Zusammenfassung: | This research has centered on the performance of functional resources that are used by a single multiple-stream pipelined processor. Such resources include arithmetic functional units and the modules that compose an interleaved memory. The functional requirements of such resources is that they perform some operation and resynchronize their results with the associated stream in the pipelined processor. In some instances, a replicated or pipelined resource can be used to achieve the required performance. However, in this research a simple non-pipelined unit with a fixed cycle time is investigated as a lower cost alternative. This resource is characterized by a cycle time, c, and a deadline, d, which if missed results in a penalty of one non-compute pass through the pipeline. The performance of this type of resource for various resource scheduling techniques has been determined through the use of Markov modeling and some model reduction methods. It is shown that very high performance can be obtained when effective use is made of the available deadlines. An extension to this model allows the consideration of resources with access times not equal to their cycle times. Various applications for this type of resource are examined including an implementation of a cost-effective control store which attains high performance through the use of interleaving |
Beschreibung: | IV, 173 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV035426527 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | he|uuuuuuuucu | ||
008 | 090407s1979 d||| bm||| 00||| eng d | ||
035 | |a (OCoLC)227429219 | ||
035 | |a (DE-599)BVBBV035426527 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
100 | 1 | |a Emer, Joel Springer |e Verfasser |4 aut | |
245 | 1 | 0 | |a Shared resources for multiple instruction stream pipelined processors |c Joel Springer Emer |
250 | |a [Mikrofiche-Ausg.] | ||
264 | 1 | |c 1979 | |
300 | |a IV, 173 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b h |2 rdamedia | ||
338 | |b he |2 rdacarrier | ||
502 | |a Urbana, Ill., Univ., Diss., 1979 | ||
520 | |a This research has centered on the performance of functional resources that are used by a single multiple-stream pipelined processor. Such resources include arithmetic functional units and the modules that compose an interleaved memory. The functional requirements of such resources is that they perform some operation and resynchronize their results with the associated stream in the pipelined processor. In some instances, a replicated or pipelined resource can be used to achieve the required performance. However, in this research a simple non-pipelined unit with a fixed cycle time is investigated as a lower cost alternative. This resource is characterized by a cycle time, c, and a deadline, d, which if missed results in a penalty of one non-compute pass through the pipeline. The performance of this type of resource for various resource scheduling techniques has been determined through the use of Markov modeling and some model reduction methods. It is shown that very high performance can be obtained when effective use is made of the available deadlines. An extension to this model allows the consideration of resources with access times not equal to their cycle times. Various applications for this type of resource are examined including an implementation of a cost-effective control store which attains high performance through the use of interleaving | ||
533 | |a Mikroform-Ausgabe |b Ann Arbor, Mich. |c Univ. Microfilms Internat. |d 1980 |e 2 Mikrofiches |n Mikrofiche-Ausg.: |7 s1980 | ||
650 | 7 | |a Operations Research |2 scgdst | |
650 | 7 | |a Computer Hardware |2 scgdst | |
650 | 7 | |a Processing equipment |2 dtict | |
650 | 7 | |a Multiprocessors |2 dtict | |
650 | 7 | |a Network flows |2 dtict | |
650 | 7 | |a Performance(engineering) |2 dtict | |
650 | 7 | |a Theses |2 dtict | |
650 | 7 | |a Memory devices |2 dtict | |
650 | 7 | |a Scheduling |2 dtict | |
650 | 7 | |a Access time |2 dtict | |
650 | 7 | |a Computer aided instruction |2 dtict | |
650 | 7 | |a Markov processes |2 dtict | |
650 | 7 | |a Electrical engineering |2 dtict | |
650 | 4 | |a Access time / dtict | |
650 | 4 | |a Computer Hardware / scgdst | |
650 | 4 | |a Computer aided instruction / dtict | |
650 | 4 | |a Electrical engineering / dtict | |
650 | 4 | |a Markov processes / dtict | |
650 | 4 | |a Memory devices / dtict | |
650 | 4 | |a Multiprocessors / dtict | |
650 | 4 | |a Network flows / dtict | |
650 | 4 | |a Operations Research / scgdst | |
650 | 4 | |a Performance(engineering) / dtict | |
650 | 4 | |a Processing equipment / dtict | |
650 | 4 | |a Scheduling / dtict | |
650 | 4 | |a Theses / dtict | |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
776 | 0 | 8 | |i Reproduktion von |a Emer, Joel Springer |t Shared resources for multiple instruction stream pipelined processors |d 1979 |
999 | |a oai:aleph.bib-bvb.de:BVB01-017346980 |
Datensatz im Suchindex
_version_ | 1804138865707974656 |
---|---|
any_adam_object | |
author | Emer, Joel Springer |
author_facet | Emer, Joel Springer |
author_role | aut |
author_sort | Emer, Joel Springer |
author_variant | j s e js jse |
building | Verbundindex |
bvnumber | BV035426527 |
ctrlnum | (OCoLC)227429219 (DE-599)BVBBV035426527 |
edition | [Mikrofiche-Ausg.] |
format | Thesis Microfilm Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03549nam a2200625 c 4500</leader><controlfield tag="001">BV035426527</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">he|uuuuuuuucu</controlfield><controlfield tag="008">090407s1979 d||| bm||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227429219</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035426527</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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="100" ind1="1" ind2=" "><subfield code="a">Emer, Joel Springer</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Shared resources for multiple instruction stream pipelined processors</subfield><subfield code="c">Joel Springer Emer</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Mikrofiche-Ausg.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 173 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">h</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">he</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Urbana, Ill., Univ., Diss., 1979</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This research has centered on the performance of functional resources that are used by a single multiple-stream pipelined processor. Such resources include arithmetic functional units and the modules that compose an interleaved memory. The functional requirements of such resources is that they perform some operation and resynchronize their results with the associated stream in the pipelined processor. In some instances, a replicated or pipelined resource can be used to achieve the required performance. However, in this research a simple non-pipelined unit with a fixed cycle time is investigated as a lower cost alternative. This resource is characterized by a cycle time, c, and a deadline, d, which if missed results in a penalty of one non-compute pass through the pipeline. The performance of this type of resource for various resource scheduling techniques has been determined through the use of Markov modeling and some model reduction methods. It is shown that very high performance can be obtained when effective use is made of the available deadlines. An extension to this model allows the consideration of resources with access times not equal to their cycle times. Various applications for this type of resource are examined including an implementation of a cost-effective control store which attains high performance through the use of interleaving</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Mikroform-Ausgabe</subfield><subfield code="b">Ann Arbor, Mich.</subfield><subfield code="c">Univ. Microfilms Internat.</subfield><subfield code="d">1980</subfield><subfield code="e">2 Mikrofiches</subfield><subfield code="n">Mikrofiche-Ausg.:</subfield><subfield code="7">s1980</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Operations Research</subfield><subfield code="2">scgdst</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">Processing equipment</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">Network flows</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Performance(engineering)</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">Memory devices</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Scheduling</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Access time</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer aided instruction</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Markov processes</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electrical engineering</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Access time / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Hardware / scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer aided instruction / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical engineering / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov processes / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory devices / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network flows / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research / scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Performance(engineering) / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Processing equipment / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theses / dtict</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="776" ind1="0" ind2="8"><subfield code="i">Reproduktion von</subfield><subfield code="a">Emer, Joel Springer</subfield><subfield code="t">Shared resources for multiple instruction stream pipelined processors</subfield><subfield code="d">1979</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017346980</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV035426527 |
illustrated | Illustrated |
indexdate | 2024-07-09T21:34:59Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017346980 |
oclc_num | 227429219 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | IV, 173 S. graph. Darst. |
publishDate | 1979 |
publishDateSearch | 1979 |
publishDateSort | 1979 |
record_format | marc |
spelling | Emer, Joel Springer Verfasser aut Shared resources for multiple instruction stream pipelined processors Joel Springer Emer [Mikrofiche-Ausg.] 1979 IV, 173 S. graph. Darst. txt rdacontent h rdamedia he rdacarrier Urbana, Ill., Univ., Diss., 1979 This research has centered on the performance of functional resources that are used by a single multiple-stream pipelined processor. Such resources include arithmetic functional units and the modules that compose an interleaved memory. The functional requirements of such resources is that they perform some operation and resynchronize their results with the associated stream in the pipelined processor. In some instances, a replicated or pipelined resource can be used to achieve the required performance. However, in this research a simple non-pipelined unit with a fixed cycle time is investigated as a lower cost alternative. This resource is characterized by a cycle time, c, and a deadline, d, which if missed results in a penalty of one non-compute pass through the pipeline. The performance of this type of resource for various resource scheduling techniques has been determined through the use of Markov modeling and some model reduction methods. It is shown that very high performance can be obtained when effective use is made of the available deadlines. An extension to this model allows the consideration of resources with access times not equal to their cycle times. Various applications for this type of resource are examined including an implementation of a cost-effective control store which attains high performance through the use of interleaving Mikroform-Ausgabe Ann Arbor, Mich. Univ. Microfilms Internat. 1980 2 Mikrofiches Mikrofiche-Ausg.: s1980 Operations Research scgdst Computer Hardware scgdst Processing equipment dtict Multiprocessors dtict Network flows dtict Performance(engineering) dtict Theses dtict Memory devices dtict Scheduling dtict Access time dtict Computer aided instruction dtict Markov processes dtict Electrical engineering dtict Access time / dtict Computer Hardware / scgdst Computer aided instruction / dtict Electrical engineering / dtict Markov processes / dtict Memory devices / dtict Multiprocessors / dtict Network flows / dtict Operations Research / scgdst Performance(engineering) / dtict Processing equipment / dtict Scheduling / dtict Theses / dtict (DE-588)4113937-9 Hochschulschrift gnd-content Reproduktion von Emer, Joel Springer Shared resources for multiple instruction stream pipelined processors 1979 |
spellingShingle | Emer, Joel Springer Shared resources for multiple instruction stream pipelined processors Operations Research scgdst Computer Hardware scgdst Processing equipment dtict Multiprocessors dtict Network flows dtict Performance(engineering) dtict Theses dtict Memory devices dtict Scheduling dtict Access time dtict Computer aided instruction dtict Markov processes dtict Electrical engineering dtict Access time / dtict Computer Hardware / scgdst Computer aided instruction / dtict Electrical engineering / dtict Markov processes / dtict Memory devices / dtict Multiprocessors / dtict Network flows / dtict Operations Research / scgdst Performance(engineering) / dtict Processing equipment / dtict Scheduling / dtict Theses / dtict |
subject_GND | (DE-588)4113937-9 |
title | Shared resources for multiple instruction stream pipelined processors |
title_auth | Shared resources for multiple instruction stream pipelined processors |
title_exact_search | Shared resources for multiple instruction stream pipelined processors |
title_full | Shared resources for multiple instruction stream pipelined processors Joel Springer Emer |
title_fullStr | Shared resources for multiple instruction stream pipelined processors Joel Springer Emer |
title_full_unstemmed | Shared resources for multiple instruction stream pipelined processors Joel Springer Emer |
title_short | Shared resources for multiple instruction stream pipelined processors |
title_sort | shared resources for multiple instruction stream pipelined processors |
topic | Operations Research scgdst Computer Hardware scgdst Processing equipment dtict Multiprocessors dtict Network flows dtict Performance(engineering) dtict Theses dtict Memory devices dtict Scheduling dtict Access time dtict Computer aided instruction dtict Markov processes dtict Electrical engineering dtict Access time / dtict Computer Hardware / scgdst Computer aided instruction / dtict Electrical engineering / dtict Markov processes / dtict Memory devices / dtict Multiprocessors / dtict Network flows / dtict Operations Research / scgdst Performance(engineering) / dtict Processing equipment / dtict Scheduling / dtict Theses / dtict |
topic_facet | Operations Research Computer Hardware Processing equipment Multiprocessors Network flows Performance(engineering) Theses Memory devices Scheduling Access time Computer aided instruction Markov processes Electrical engineering Access time / dtict Computer Hardware / scgdst Computer aided instruction / dtict Electrical engineering / dtict Markov processes / dtict Memory devices / dtict Multiprocessors / dtict Network flows / dtict Operations Research / scgdst Performance(engineering) / dtict Processing equipment / dtict Scheduling / dtict Theses / dtict Hochschulschrift |
work_keys_str_mv | AT emerjoelspringer sharedresourcesformultipleinstructionstreampipelinedprocessors |