Reliable interconnection networks for parallel computers:
Abstract: "A new protocol, the unique token protocol, for reliably transporting data in a network is described. This protocol makes use of existing buffer storage in the network for the replication of data and avoids duplicate elimination at the destination through the use of a token. The uniqu...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Cambridge, Mas.]
MIT Artificial Intelligence Laboratory
1991
|
| Subjects: | |
| Summary: | Abstract: "A new protocol, the unique token protocol, for reliably transporting data in a network is described. This protocol makes use of existing buffer storage in the network for the replication of data and avoids duplicate elimination at the destination through the use of a token. The unique token protocol is compared to end-to-end protocols in terms [sic] bandwidth, latency, and memory requirements, for which it is found to equal or better them. It is also shown to have constant memory requirements per switching and processing element, thus allowing networks employing the protocol to be arbitrarily large In addition, the organization of a reliable switching element incorporating the protocol is described. A register transfer model of the switching has been implemented. The model and its validation are presented. |
| Item Description: | Includes bibliographical references |
| Physical Description: | 78 S. Ill. 28 cm |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035037414 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 080904s1991 a||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)26271519 | ||
| 035 | |a (DE-599)BVBBV035037414 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 050 | 0 | |a Q335.M41 | |
| 088 | |a AI TR 1294 | ||
| 100 | 1 | |a Dennison, Larry R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Reliable interconnection networks for parallel computers |c by Larry R. Dennison |
| 246 | 1 | 3 | |a AI TR 1294 |
| 264 | 1 | |a [Cambridge, Mas.] |b MIT Artificial Intelligence Laboratory |c 1991 | |
| 300 | |a 78 S. |b Ill. |c 28 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes bibliographical references | ||
| 502 | |a Zugl.: Cambridge, Mass., Massachusetts Institute of Technology, Diss., 1991 | ||
| 520 | 3 | |a Abstract: "A new protocol, the unique token protocol, for reliably transporting data in a network is described. This protocol makes use of existing buffer storage in the network for the replication of data and avoids duplicate elimination at the destination through the use of a token. The unique token protocol is compared to end-to-end protocols in terms [sic] bandwidth, latency, and memory requirements, for which it is found to equal or better them. It is also shown to have constant memory requirements per switching and processing element, thus allowing networks employing the protocol to be arbitrarily large | |
| 520 | 3 | |a In addition, the organization of a reliable switching element incorporating the protocol is described. A register transfer model of the switching has been implemented. The model and its validation are presented. | |
| 650 | 4 | |a Computer network protocols | |
| 650 | 4 | |a Fault-tolerant computing | |
| 650 | 4 | |a Computer network protocols | |
| 650 | 4 | |a Fault-tolerant computing | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016706289 | ||
Record in the Search Index
| _version_ | 1804137970695929856 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Dennison, Larry R. |
| author_facet | Dennison, Larry R. |
| author_role | aut |
| author_sort | Dennison, Larry R. |
| author_variant | l r d lr lrd |
| building | Verbundindex |
| bvnumber | BV035037414 |
| callnumber-first | Q - Science |
| callnumber-label | Q335 |
| callnumber-raw | Q335.M41 |
| callnumber-search | Q335.M41 |
| callnumber-sort | Q 3335 M41 |
| callnumber-subject | Q - General Science |
| ctrlnum | (OCoLC)26271519 (DE-599)BVBBV035037414 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02036nam a2200385 c 4500</leader><controlfield tag="001">BV035037414</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080904s1991 a||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26271519</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035037414</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-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">Q335.M41</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">AI TR 1294</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dennison, Larry R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reliable interconnection networks for parallel computers</subfield><subfield code="c">by Larry R. Dennison</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">AI TR 1294</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[Cambridge, Mas.]</subfield><subfield code="b">MIT Artificial Intelligence Laboratory</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">78 S.</subfield><subfield code="b">Ill.</subfield><subfield code="c">28 cm</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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Cambridge, Mass., Massachusetts Institute of Technology, Diss., 1991</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A new protocol, the unique token protocol, for reliably transporting data in a network is described. This protocol makes use of existing buffer storage in the network for the replication of data and avoids duplicate elimination at the destination through the use of a token. The unique token protocol is compared to end-to-end protocols in terms [sic] bandwidth, latency, and memory requirements, for which it is found to equal or better them. It is also shown to have constant memory requirements per switching and processing element, thus allowing networks employing the protocol to be arbitrarily large</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In addition, the organization of a reliable switching element incorporating the protocol is described. A register transfer model of the switching has been implemented. The model and its validation are presented.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network protocols</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerant computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network protocols</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerant computing</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-016706289</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035037414 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:52:03Z |
| indexdate | 2024-07-09T21:20:45Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016706289 |
| oclc_num | 26271519 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 78 S. Ill. 28 cm |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | MIT Artificial Intelligence Laboratory |
| record_format | marc |
| spelling | Dennison, Larry R. Verfasser aut Reliable interconnection networks for parallel computers by Larry R. Dennison AI TR 1294 [Cambridge, Mas.] MIT Artificial Intelligence Laboratory 1991 78 S. Ill. 28 cm txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references Zugl.: Cambridge, Mass., Massachusetts Institute of Technology, Diss., 1991 Abstract: "A new protocol, the unique token protocol, for reliably transporting data in a network is described. This protocol makes use of existing buffer storage in the network for the replication of data and avoids duplicate elimination at the destination through the use of a token. The unique token protocol is compared to end-to-end protocols in terms [sic] bandwidth, latency, and memory requirements, for which it is found to equal or better them. It is also shown to have constant memory requirements per switching and processing element, thus allowing networks employing the protocol to be arbitrarily large In addition, the organization of a reliable switching element incorporating the protocol is described. A register transfer model of the switching has been implemented. The model and its validation are presented. Computer network protocols Fault-tolerant computing (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Dennison, Larry R. Reliable interconnection networks for parallel computers Computer network protocols Fault-tolerant computing |
| subject_GND | (DE-588)4113937-9 |
| title | Reliable interconnection networks for parallel computers |
| title_alt | AI TR 1294 |
| title_auth | Reliable interconnection networks for parallel computers |
| title_exact_search | Reliable interconnection networks for parallel computers |
| title_exact_search_txtP | Reliable interconnection networks for parallel computers |
| title_full | Reliable interconnection networks for parallel computers by Larry R. Dennison |
| title_fullStr | Reliable interconnection networks for parallel computers by Larry R. Dennison |
| title_full_unstemmed | Reliable interconnection networks for parallel computers by Larry R. Dennison |
| title_short | Reliable interconnection networks for parallel computers |
| title_sort | reliable interconnection networks for parallel computers |
| topic | Computer network protocols Fault-tolerant computing |
| topic_facet | Computer network protocols Fault-tolerant computing Hochschulschrift |
| work_keys_str_mv | AT dennisonlarryr reliableinterconnectionnetworksforparallelcomputers AT dennisonlarryr aitr1294 |