Reliable broadcasts through partial broadcasts:
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. We prove lower bounds for the execution time of any reliable broadcast protocol in distributed systems with...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Ithaca, New York
1985
|
| Series: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
720 |
| Subjects: | |
| Summary: | 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. We prove lower bounds for the execution time of any reliable broadcast protocol in distributed systems with arbitrary communication networks. Our results apply to common distributed system architectures consisting of multiple broadcast network-based clusters of processors. In light of these lower bounds, our earlier protocols are shown to be optimal with respect to execution time. |
| Physical Description: | 21 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010590152 | ||
| 003 | DE-604 | ||
| 005 | 19960202 | ||
| 007 | t | ||
| 008 | 960130s1985 |||| 00||| engod | ||
| 035 | |a (OCoLC)14906691 | ||
| 035 | |a (DE-599)BVBBV010590152 | ||
| 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 broadcasts through partial broadcasts |c Özalp Babaog̃lu ; Pat Stephenson |
| 264 | 1 | |a Ithaca, New York |c 1985 | |
| 300 | |a 21 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 720 | |
| 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. We prove lower bounds for the execution time of any reliable broadcast protocol in distributed systems with arbitrary communication networks. Our results apply to common distributed system architectures consisting of multiple broadcast network-based clusters of processors. In light of these lower bounds, our earlier protocols are shown to be optimal with respect to execution time. | |
| 650 | 4 | |a Computer architecture | |
| 650 | 4 | |a Computer networks | |
| 700 | 1 | |a Stephenson, Patrick |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 720 |w (DE-604)BV006185504 |9 720 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007061969 | ||
Record in the Search Index
| _version_ | 1804125061045551104 |
|---|---|
| any_adam_object | |
| author | Babaoğlu, Özalp Stephenson, Patrick |
| author_facet | Babaoğlu, Özalp Stephenson, Patrick |
| author_role | aut aut |
| author_sort | Babaoğlu, Özalp |
| author_variant | ö b öb p s ps |
| building | Verbundindex |
| bvnumber | BV010590152 |
| ctrlnum | (OCoLC)14906691 (DE-599)BVBBV010590152 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01618nam a2200313 cb4500</leader><controlfield tag="001">BV010590152</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960202 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960130s1985 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14906691</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010590152</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 broadcasts through partial broadcasts</subfield><subfield code="c">Özalp Babaog̃lu ; Pat Stephenson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 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">720</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. We prove lower bounds for the execution time of any reliable broadcast protocol in distributed systems with arbitrary communication networks. Our results apply to common distributed system architectures consisting of multiple broadcast network-based clusters of processors. In light of these lower bounds, our earlier protocols are shown to be optimal with respect to execution time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</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">720</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">720</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007061969</subfield></datafield></record></collection> |
| id | DE-604.BV010590152 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:34Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007061969 |
| oclc_num | 14906691 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 21 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Babaoğlu, Özalp Verfasser aut Reliable broadcasts through partial broadcasts Özalp Babaog̃lu ; Pat Stephenson Ithaca, New York 1985 21 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 720 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. We prove lower bounds for the execution time of any reliable broadcast protocol in distributed systems with arbitrary communication networks. Our results apply to common distributed system architectures consisting of multiple broadcast network-based clusters of processors. In light of these lower bounds, our earlier protocols are shown to be optimal with respect to execution time. Computer architecture Computer networks Stephenson, Patrick Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 720 (DE-604)BV006185504 720 |
| spellingShingle | Babaoğlu, Özalp Stephenson, Patrick Reliable broadcasts through partial broadcasts Computer architecture Computer networks |
| title | Reliable broadcasts through partial broadcasts |
| title_auth | Reliable broadcasts through partial broadcasts |
| title_exact_search | Reliable broadcasts through partial broadcasts |
| title_full | Reliable broadcasts through partial broadcasts Özalp Babaog̃lu ; Pat Stephenson |
| title_fullStr | Reliable broadcasts through partial broadcasts Özalp Babaog̃lu ; Pat Stephenson |
| title_full_unstemmed | Reliable broadcasts through partial broadcasts Özalp Babaog̃lu ; Pat Stephenson |
| title_short | Reliable broadcasts through partial broadcasts |
| title_sort | reliable broadcasts through partial broadcasts |
| topic | Computer architecture Computer networks |
| topic_facet | Computer architecture Computer networks |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT babaogluozalp reliablebroadcaststhroughpartialbroadcasts AT stephensonpatrick reliablebroadcaststhroughpartialbroadcasts |