Reliable broadcast protocols and network architecture: tradeoffs and lower bounds:
Reliable Broadcast is a mechanism by which a processor in a distributed system disseminates a value to all other processors in the presence of both communication and processor failures. Protocols to achieve Reliable Broadcast are at the heart of most fault-tolerant applications. We characterize the...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
754 |
| Schlagworte: | |
| Zusammenfassung: | Reliable Broadcast is a mechanism by which a processor in a distributed system disseminates a value to all other processors in the presence of both communication and processor failures. Protocols to achieve Reliable Broadcast are at the heart of most fault-tolerant applications. We characterize the execution time of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures such as fully-connected point-to-point graphs, linear chains, rings, broadcast networks (such as Ethernet) and buses. We derive a protocol that implements Reliable Broadcast for any member within this class. We present a novel proof technique to obtain lower bound results for Reliable Broadcast in this environment. This proof technique is based on graph mappings. The hardware-software tradeoffs that are revealed between performance, resiliency and network cost offer many new alternatives previously not considered in designing fault-tolerant systems. |
| Beschreibung: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594562 | ||
| 003 | DE-604 | ||
| 005 | 19960202 | ||
| 007 | t | ||
| 008 | 960201s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)15729239 | ||
| 035 | |a (DE-599)BVBBV010594562 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Babaoğlu, Özalp |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Reliable broadcast protocols and network architecture: tradeoffs and lower bounds |c Özalp Babaog̃lu ; Rogério Drummond ; Pat Stephenson |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 754 | |
| 520 | 3 | |a Reliable Broadcast is a mechanism by which a processor in a distributed system disseminates a value to all other processors in the presence of both communication and processor failures. Protocols to achieve Reliable Broadcast are at the heart of most fault-tolerant applications. We characterize the execution time of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures such as fully-connected point-to-point graphs, linear chains, rings, broadcast networks (such as Ethernet) and buses. We derive a protocol that implements Reliable Broadcast for any member within this class. We present a novel proof technique to obtain lower bound results for Reliable Broadcast in this environment. This proof technique is based on graph mappings. The hardware-software tradeoffs that are revealed between performance, resiliency and network cost offer many new alternatives previously not considered in designing fault-tolerant systems. | |
| 650 | 4 | |a Fault-tolerant computing | |
| 650 | 4 | |a System design | |
| 700 | 1 | |a Drummond, Rogério |e Verfasser |4 aut | |
| 700 | 1 | |a Stephenson, Patrick |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 754 |w (DE-604)BV006185504 |9 754 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007065163 | ||
Datensatz im Suchindex
| _version_ | 1804125065849077760 |
|---|---|
| any_adam_object | |
| author | Babaoğlu, Özalp Drummond, Rogério Stephenson, Patrick |
| author_facet | Babaoğlu, Özalp Drummond, Rogério Stephenson, Patrick |
| author_role | aut aut aut |
| author_sort | Babaoğlu, Özalp |
| author_variant | ö b öb r d rd p s ps |
| building | Verbundindex |
| bvnumber | BV010594562 |
| ctrlnum | (OCoLC)15729239 (DE-599)BVBBV010594562 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02199nam a2200325 cb4500</leader><controlfield tag="001">BV010594562</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960202 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960201s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15729239</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594562</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">Babaoğlu, Özalp</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reliable broadcast protocols and network architecture: tradeoffs and lower bounds</subfield><subfield code="c">Özalp Babaog̃lu ; Rogério Drummond ; Pat Stephenson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">754</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Reliable Broadcast is a mechanism by which a processor in a distributed system disseminates a value to all other processors in the presence of both communication and processor failures. Protocols to achieve Reliable Broadcast are at the heart of most fault-tolerant applications. We characterize the execution time of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures such as fully-connected point-to-point graphs, linear chains, rings, broadcast networks (such as Ethernet) and buses. We derive a protocol that implements Reliable Broadcast for any member within this class. We present a novel proof technique to obtain lower bound results for Reliable Broadcast in this environment. This proof technique is based on graph mappings. The hardware-software tradeoffs that are revealed between performance, resiliency and network cost offer many new alternatives previously not considered in designing fault-tolerant systems.</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">System design</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Drummond, Rogério</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stephenson, Patrick</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: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">754</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">754</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007065163</subfield></datafield></record></collection> |
| id | DE-604.BV010594562 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007065163 |
| oclc_num | 15729239 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Babaoğlu, Özalp Verfasser aut Reliable broadcast protocols and network architecture: tradeoffs and lower bounds Özalp Babaog̃lu ; Rogério Drummond ; Pat Stephenson Ithaca, New York 1986 20 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 754 Reliable Broadcast is a mechanism by which a processor in a distributed system disseminates a value to all other processors in the presence of both communication and processor failures. Protocols to achieve Reliable Broadcast are at the heart of most fault-tolerant applications. We characterize the execution time of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures such as fully-connected point-to-point graphs, linear chains, rings, broadcast networks (such as Ethernet) and buses. We derive a protocol that implements Reliable Broadcast for any member within this class. We present a novel proof technique to obtain lower bound results for Reliable Broadcast in this environment. This proof technique is based on graph mappings. The hardware-software tradeoffs that are revealed between performance, resiliency and network cost offer many new alternatives previously not considered in designing fault-tolerant systems. Fault-tolerant computing System design Drummond, Rogério Verfasser aut Stephenson, Patrick Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 754 (DE-604)BV006185504 754 |
| spellingShingle | Babaoğlu, Özalp Drummond, Rogério Stephenson, Patrick Reliable broadcast protocols and network architecture: tradeoffs and lower bounds Fault-tolerant computing System design |
| title | Reliable broadcast protocols and network architecture: tradeoffs and lower bounds |
| title_auth | Reliable broadcast protocols and network architecture: tradeoffs and lower bounds |
| title_exact_search | Reliable broadcast protocols and network architecture: tradeoffs and lower bounds |
| title_full | Reliable broadcast protocols and network architecture: tradeoffs and lower bounds Özalp Babaog̃lu ; Rogério Drummond ; Pat Stephenson |
| title_fullStr | Reliable broadcast protocols and network architecture: tradeoffs and lower bounds Özalp Babaog̃lu ; Rogério Drummond ; Pat Stephenson |
| title_full_unstemmed | Reliable broadcast protocols and network architecture: tradeoffs and lower bounds Özalp Babaog̃lu ; Rogério Drummond ; Pat Stephenson |
| title_short | Reliable broadcast protocols and network architecture: tradeoffs and lower bounds |
| title_sort | reliable broadcast protocols and network architecture tradeoffs and lower bounds |
| topic | Fault-tolerant computing System design |
| topic_facet | Fault-tolerant computing System design |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT babaogluozalp reliablebroadcastprotocolsandnetworkarchitecturetradeoffsandlowerbounds AT drummondrogerio reliablebroadcastprotocolsandnetworkarchitecturetradeoffsandlowerbounds AT stephensonpatrick reliablebroadcastprotocolsandnetworkarchitecturetradeoffsandlowerbounds |