Design of a Bit-sliced network for a shared-memory multiprocessor system
Abstract: "Packet switching crossbar switches with matching data widths and addressing range will provide the most efficient building blocks for a shared memory multi-processor network, providing the lowest latency consistent with high data throughput and error tolerance for a low device count....
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1992
|
Schriftenreihe: | University <Edinburgh> / Department of Computer Science: CSR
19 |
Schlagworte: | |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008993636 | ||
003 | DE-604 | ||
005 | 19940721 | ||
007 | t| | ||
008 | 940206s1992 xx |||| 00||| eng d | ||
035 | |a (OCoLC)32408785 | ||
035 | |a (DE-599)BVBBV008993636 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T |a DE-91G | ||
100 | 1 | |a Rogers, D. J. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Design of a Bit-sliced network for a shared-memory multiprocessor system |c D. J. Rogers & R. N. Ibbett |
264 | 1 | |a Edinburgh |c 1992 | |
300 | |a 23 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 19 | |
520 | 3 | |a Abstract: "Packet switching crossbar switches with matching data widths and addressing range will provide the most efficient building blocks for a shared memory multi-processor network, providing the lowest latency consistent with high data throughput and error tolerance for a low device count. A demonstration device for a 4*4 crossbar switch with 2-bit data paths has been implemented. Results from this show that the pad-bound assumption, inherent in the original argument would be true for a full custom implementation in a sub-micron process. Simulation for the arbitration method used is given, predicting that fairness is only slightly compromised against optimal for the sake of considerable reduction in complexity, if priority is based solely on queue length." | |
650 | 7 | |a Computer hardware |2 sigle | |
650 | 7 | |a Computer software |2 sigle | |
650 | 4 | |a Multiprocessors | |
700 | 1 | |a Ibbett, R. N. |e Verfasser |4 aut | |
810 | 2 | |a Department of Computer Science: CSR |t University <Edinburgh> |v 19 |w (DE-604)BV008906637 |9 19 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005942373 |
Datensatz im Suchindex
DE-BY-TUM_call_number | 0111 2001 B 6032 |
---|---|
DE-BY-TUM_katkey | 615932 |
DE-BY-TUM_location | 01 |
DE-BY-TUM_media_number | 040010050098 |
_version_ | 1820861536641482752 |
any_adam_object | |
author | Rogers, D. J. Ibbett, R. N. |
author_facet | Rogers, D. J. Ibbett, R. N. |
author_role | aut aut |
author_sort | Rogers, D. J. |
author_variant | d j r dj djr r n i rn rni |
building | Verbundindex |
bvnumber | BV008993636 |
ctrlnum | (OCoLC)32408785 (DE-599)BVBBV008993636 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01820nam a2200325 cb4500</leader><controlfield tag="001">BV008993636</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940721 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1992 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32408785</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993636</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-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rogers, D. J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Design of a Bit-sliced network for a shared-memory multiprocessor system</subfield><subfield code="c">D. J. Rogers & R. N. Ibbett</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 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">19</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Packet switching crossbar switches with matching data widths and addressing range will provide the most efficient building blocks for a shared memory multi-processor network, providing the lowest latency consistent with high data throughput and error tolerance for a low device count. A demonstration device for a 4*4 crossbar switch with 2-bit data paths has been implemented. Results from this show that the pad-bound assumption, inherent in the original argument would be true for a full custom implementation in a sub-micron process. Simulation for the arbitration method used is given, predicting that fairness is only slightly compromised against optimal for the sake of considerable reduction in complexity, if priority is based solely on queue length."</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">Multiprocessors</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ibbett, R. N.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">19</subfield><subfield code="w">(DE-604)BV008906637</subfield><subfield code="9">19</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005942373</subfield></datafield></record></collection> |
id | DE-604.BV008993636 |
illustrated | Not Illustrated |
indexdate | 2024-12-23T12:55:41Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005942373 |
oclc_num | 32408785 |
open_access_boolean | |
owner | DE-29T DE-91G DE-BY-TUM |
owner_facet | DE-29T DE-91G DE-BY-TUM |
physical | 23 S. |
publishDate | 1992 |
publishDateSearch | 1992 |
publishDateSort | 1992 |
record_format | marc |
series2 | University <Edinburgh> / Department of Computer Science: CSR |
spellingShingle | Rogers, D. J. Ibbett, R. N. Design of a Bit-sliced network for a shared-memory multiprocessor system Computer hardware sigle Computer software sigle Multiprocessors |
title | Design of a Bit-sliced network for a shared-memory multiprocessor system |
title_auth | Design of a Bit-sliced network for a shared-memory multiprocessor system |
title_exact_search | Design of a Bit-sliced network for a shared-memory multiprocessor system |
title_full | Design of a Bit-sliced network for a shared-memory multiprocessor system D. J. Rogers & R. N. Ibbett |
title_fullStr | Design of a Bit-sliced network for a shared-memory multiprocessor system D. J. Rogers & R. N. Ibbett |
title_full_unstemmed | Design of a Bit-sliced network for a shared-memory multiprocessor system D. J. Rogers & R. N. Ibbett |
title_short | Design of a Bit-sliced network for a shared-memory multiprocessor system |
title_sort | design of a bit sliced network for a shared memory multiprocessor system |
topic | Computer hardware sigle Computer software sigle Multiprocessors |
topic_facet | Computer hardware Computer software Multiprocessors |
volume_link | (DE-604)BV008906637 |
work_keys_str_mv | AT rogersdj designofabitslicednetworkforasharedmemorymultiprocessorsystem AT ibbettrn designofabitslicednetworkforasharedmemorymultiprocessorsystem |