Stopping times of distributed consensus protocols: a probabilistic analysis
Given a model where each processor remains correct for an exponentially distributed random time and then fails independently of the others, we characterize system executions that permit the processors to reach consensus. We show that with non-zero probability, a protocol can achieve consensus even d...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
756 |
| Schlagworte: | |
| Zusammenfassung: | Given a model where each processor remains correct for an exponentially distributed random time and then fails independently of the others, we characterize system executions that permit the processors to reach consensus. We show that with non-zero probability, a protocol can achieve consensus even during executions where the number of actual processors to fail exceeds its resiliency. |
| Beschreibung: | 11 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594595 | ||
| 003 | DE-604 | ||
| 005 | 20070829 | ||
| 007 | t | ||
| 008 | 960201s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)15729269 | ||
| 035 | |a (DE-599)BVBBV010594595 | ||
| 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 Stopping times of distributed consensus protocols |b a probabilistic analysis |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 11 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 756 | |
| 520 | 3 | |a Given a model where each processor remains correct for an exponentially distributed random time and then fails independently of the others, we characterize system executions that permit the processors to reach consensus. We show that with non-zero probability, a protocol can achieve consensus even during executions where the number of actual processors to fail exceeds its resiliency. | |
| 650 | 4 | |a Fault-tolerant computing | |
| 650 | 4 | |a System design | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 756 |w (DE-604)BV006185504 |9 756 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007065192 | ||
Datensatz im Suchindex
| _version_ | 1804125065891020800 |
|---|---|
| any_adam_object | |
| author | Babaoğlu, Özalp |
| author_facet | Babaoğlu, Özalp |
| author_role | aut |
| author_sort | Babaoğlu, Özalp |
| author_variant | ö b öb |
| building | Verbundindex |
| bvnumber | BV010594595 |
| ctrlnum | (OCoLC)15729269 (DE-599)BVBBV010594595 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01369nam a2200301 cb4500</leader><controlfield tag="001">BV010594595</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070829 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960201s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15729269</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594595</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">Stopping times of distributed consensus protocols</subfield><subfield code="b">a probabilistic analysis</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">11 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">756</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Given a model where each processor remains correct for an exponentially distributed random time and then fails independently of the others, we characterize system executions that permit the processors to reach consensus. We show that with non-zero probability, a protocol can achieve consensus even during executions where the number of actual processors to fail exceeds its resiliency.</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="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">756</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">756</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007065192</subfield></datafield></record></collection> |
| id | DE-604.BV010594595 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007065192 |
| oclc_num | 15729269 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 11 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 Stopping times of distributed consensus protocols a probabilistic analysis Ithaca, New York 1986 11 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 756 Given a model where each processor remains correct for an exponentially distributed random time and then fails independently of the others, we characterize system executions that permit the processors to reach consensus. We show that with non-zero probability, a protocol can achieve consensus even during executions where the number of actual processors to fail exceeds its resiliency. Fault-tolerant computing System design Department of Computer Science: Technical report Cornell University <Ithaca, NY> 756 (DE-604)BV006185504 756 |
| spellingShingle | Babaoğlu, Özalp Stopping times of distributed consensus protocols a probabilistic analysis Fault-tolerant computing System design |
| title | Stopping times of distributed consensus protocols a probabilistic analysis |
| title_auth | Stopping times of distributed consensus protocols a probabilistic analysis |
| title_exact_search | Stopping times of distributed consensus protocols a probabilistic analysis |
| title_full | Stopping times of distributed consensus protocols a probabilistic analysis |
| title_fullStr | Stopping times of distributed consensus protocols a probabilistic analysis |
| title_full_unstemmed | Stopping times of distributed consensus protocols a probabilistic analysis |
| title_short | Stopping times of distributed consensus protocols |
| title_sort | stopping times of distributed consensus protocols a probabilistic analysis |
| title_sub | a probabilistic analysis |
| topic | Fault-tolerant computing System design |
| topic_facet | Fault-tolerant computing System design |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT babaogluozalp stoppingtimesofdistributedconsensusprotocolsaprobabilisticanalysis |