Time-communication tradeoffs for reliable broadcast protocols:
In the Reliable Broadcast Problem, a processor disseminates a value to all other processors in a distributed system where both processors and communication components are subject to failures. Solutions to this Reliable Broadcast problem are at the heart of most fault-tolerant applications. We charac...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, NY
1985
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report
687. |
| Schlagworte: | |
| Zusammenfassung: | In the Reliable Broadcast Problem, a processor disseminates a value to all other processors in a distributed system where both processors and communication components are subject to failures. Solutions to this Reliable Broadcast problem are at the heart of most fault-tolerant applications. We characterize the execution of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures constructed out of 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. The execution time of the protocol is a linear function of the two parameters that characterize each network instance. 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: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006527927 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 930210s1985 |||| 00||| eng d | ||
| 035 | |a (OCoLC)16650206 | ||
| 035 | |a (DE-599)BVBBV006527927 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a SS 4570 |0 (DE-625)143475: |2 rvk | ||
| 100 | 1 | |a Babaoğlu, Özalp |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Time-communication tradeoffs for reliable broadcast protocols |c Özalp Baboḡlu ; Rogério Drummond |
| 264 | 1 | |a Ithaca, NY |c 1985 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report |v 687. | |
| 520 | 3 | |a In the Reliable Broadcast Problem, a processor disseminates a value to all other processors in a distributed system where both processors and communication components are subject to failures. Solutions to this Reliable Broadcast problem are at the heart of most fault-tolerant applications. We characterize the execution of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures constructed out of 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. The execution time of the protocol is a linear function of the two parameters that characterize each network instance. 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 Computer network protocols | |
| 650 | 4 | |a Fault-tolerant computing | |
| 700 | 1 | |a Drummond, Rogério |e Verfasser |4 aut | |
| 810 | 2 | |a Dep. of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 687. |w (DE-604)BV006185504 |9 687 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-004157543 | ||
Datensatz im Suchindex
| _version_ | 1804120794215743488 |
|---|---|
| any_adam_object | |
| author | Babaoğlu, Özalp Drummond, Rogério |
| author_facet | Babaoğlu, Özalp Drummond, Rogério |
| author_role | aut aut |
| author_sort | Babaoğlu, Özalp |
| author_variant | ö b öb r d rd |
| building | Verbundindex |
| bvnumber | BV006527927 |
| classification_rvk | SS 4570 |
| ctrlnum | (OCoLC)16650206 (DE-599)BVBBV006527927 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02130nam a2200325 cb4500</leader><controlfield tag="001">BV006527927</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930210s1985 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)16650206</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006527927</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="084" ind1=" " ind2=" "><subfield code="a">SS 4570</subfield><subfield code="0">(DE-625)143475:</subfield><subfield code="2">rvk</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">Time-communication tradeoffs for reliable broadcast protocols</subfield><subfield code="c">Özalp Baboḡlu ; Rogério Drummond</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, NY</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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> / Dep. of Computer Science: Technical report</subfield><subfield code="v">687.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In the Reliable Broadcast Problem, a processor disseminates a value to all other processors in a distributed system where both processors and communication components are subject to failures. Solutions to this Reliable Broadcast problem are at the heart of most fault-tolerant applications. We characterize the execution of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures constructed out of 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. The execution time of the protocol is a linear function of the two parameters that characterize each network instance. 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">Computer network protocols</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerant computing</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="810" ind1="2" ind2=" "><subfield code="a">Dep. of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">687.</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">687</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004157543</subfield></datafield></record></collection> |
| id | DE-604.BV006527927 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:47:45Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004157543 |
| oclc_num | 16650206 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report |
| spelling | Babaoğlu, Özalp Verfasser aut Time-communication tradeoffs for reliable broadcast protocols Özalp Baboḡlu ; Rogério Drummond Ithaca, NY 1985 19 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report 687. In the Reliable Broadcast Problem, a processor disseminates a value to all other processors in a distributed system where both processors and communication components are subject to failures. Solutions to this Reliable Broadcast problem are at the heart of most fault-tolerant applications. We characterize the execution of Reliable Broadcast protocols as a function of the properties of the underlying communication network. The class of networks considered includes familiar communication structures constructed out of 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. The execution time of the protocol is a linear function of the two parameters that characterize each network instance. 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. Computer network protocols Fault-tolerant computing Drummond, Rogério Verfasser aut Dep. of Computer Science: Technical report Cornell University <Ithaca, NY> 687. (DE-604)BV006185504 687 |
| spellingShingle | Babaoğlu, Özalp Drummond, Rogério Time-communication tradeoffs for reliable broadcast protocols Computer network protocols Fault-tolerant computing |
| title | Time-communication tradeoffs for reliable broadcast protocols |
| title_auth | Time-communication tradeoffs for reliable broadcast protocols |
| title_exact_search | Time-communication tradeoffs for reliable broadcast protocols |
| title_full | Time-communication tradeoffs for reliable broadcast protocols Özalp Baboḡlu ; Rogério Drummond |
| title_fullStr | Time-communication tradeoffs for reliable broadcast protocols Özalp Baboḡlu ; Rogério Drummond |
| title_full_unstemmed | Time-communication tradeoffs for reliable broadcast protocols Özalp Baboḡlu ; Rogério Drummond |
| title_short | Time-communication tradeoffs for reliable broadcast protocols |
| title_sort | time communication tradeoffs for reliable broadcast protocols |
| topic | Computer network protocols Fault-tolerant computing |
| topic_facet | Computer network protocols Fault-tolerant computing |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT babaogluozalp timecommunicationtradeoffsforreliablebroadcastprotocols AT drummondrogerio timecommunicationtradeoffsforreliablebroadcastprotocols |