Impossibility of distributed consensus with one faulty process:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1982
|
| Schlagwörter: | |
| Abstract: | The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author). |
| Umfang: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876358 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t| | ||
| 008 | 880307s1982 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)227593066 | ||
| 035 | |a (DE-599)BVBBV021876358 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-282 | ||
| 100 | 1 | |a Fischer, Michael J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Impossibility of distributed consensus with one faulty process |c Michael J. Fischer ; Nancy A. Lynch and Michael S. Paterson |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1982 | |
| 300 | |a 10 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author). | |
| 650 | 7 | |a Asynchronous computers |2 dtict | |
| 650 | 7 | |a Asynchronous systems |2 dtict | |
| 650 | 7 | |a Binary arithmetic |2 dtict | |
| 650 | 7 | |a Computations |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computer Systems |2 scgdst | |
| 650 | 7 | |a Configurations |2 dtict | |
| 650 | 7 | |a Data management |2 dtict | |
| 650 | 7 | |a Data processing |2 dtict | |
| 650 | 7 | |a Distributed data processing |2 dtict | |
| 650 | 7 | |a Fault tolerant computing |2 dtict | |
| 650 | 7 | |a Message processing |2 dtict | |
| 650 | 7 | |a Problem solving |2 dtict | |
| 650 | 7 | |a Reliability |2 dtict | |
| 650 | 7 | |a Value |2 dtict | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 0 | 7 | |a Fehlertoleranz |0 (DE-588)4123192-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteiltes Datenbanksystem |0 (DE-588)4121865-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Verteiltes Datenbanksystem |0 (DE-588)4121865-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Fehlertoleranz |0 (DE-588)4123192-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Lynch, Nancy A. |d 1948- |e Verfasser |0 (DE-588)121919625 |4 aut | |
| 700 | 1 | |a Paterson, Michael S. |d 1942- |e Verfasser |0 (DE-588)1047956071 |4 aut | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015091976 | |
Datensatz im Suchindex
| _version_ | 1818963357278928896 |
|---|---|
| any_adam_object | |
| author | Fischer, Michael J. Lynch, Nancy A. 1948- Paterson, Michael S. 1942- |
| author_GND | (DE-588)121919625 (DE-588)1047956071 |
| author_facet | Fischer, Michael J. Lynch, Nancy A. 1948- Paterson, Michael S. 1942- |
| author_role | aut aut aut |
| author_sort | Fischer, Michael J. |
| author_variant | m j f mj mjf n a l na nal m s p ms msp |
| building | Verbundindex |
| bvnumber | BV021876358 |
| ctrlnum | (OCoLC)227593066 (DE-599)BVBBV021876358 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02315nam a2200553zc 4500</leader><controlfield tag="001">BV021876358</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">880307s1982 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227593066</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876358</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-282</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fischer, Michael J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Impossibility of distributed consensus with one faulty process</subfield><subfield code="c">Michael J. Fischer ; Nancy A. Lynch and Michael S. Paterson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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="520" ind1="3" ind2=" "><subfield code="a">The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Asynchronous computers</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Asynchronous systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Binary arithmetic</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Systems</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Configurations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data management</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Distributed data processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fault tolerant computing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Message processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Problem solving</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Reliability</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Value</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fehlertoleranz</subfield><subfield code="0">(DE-588)4123192-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteiltes Datenbanksystem</subfield><subfield code="0">(DE-588)4121865-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Verteiltes Datenbanksystem</subfield><subfield code="0">(DE-588)4121865-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Fehlertoleranz</subfield><subfield code="0">(DE-588)4123192-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lynch, Nancy A.</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121919625</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Paterson, Michael S.</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1047956071</subfield><subfield code="4">aut</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091976</subfield></datafield></record></collection> |
| id | DE-604.BV021876358 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T12:43:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091976 |
| oclc_num | 227593066 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 10 S. |
| publishDate | 1982 |
| publishDateSearch | 1982 |
| publishDateSort | 1982 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Fischer, Michael J. Verfasser aut Impossibility of distributed consensus with one faulty process Michael J. Fischer ; Nancy A. Lynch and Michael S. Paterson Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1982 10 S. txt rdacontent n rdamedia nc rdacarrier The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author). Asynchronous computers dtict Asynchronous systems dtict Binary arithmetic dtict Computations dtict Computer Hardware scgdst Computer Systems scgdst Configurations dtict Data management dtict Data processing dtict Distributed data processing dtict Fault tolerant computing dtict Message processing dtict Problem solving dtict Reliability dtict Value dtict Datenverarbeitung Fehlertoleranz (DE-588)4123192-2 gnd rswk-swf Verteiltes Datenbanksystem (DE-588)4121865-6 gnd rswk-swf Verteiltes Datenbanksystem (DE-588)4121865-6 s DE-604 Fehlertoleranz (DE-588)4123192-2 s Lynch, Nancy A. 1948- Verfasser (DE-588)121919625 aut Paterson, Michael S. 1942- Verfasser (DE-588)1047956071 aut |
| spellingShingle | Fischer, Michael J. Lynch, Nancy A. 1948- Paterson, Michael S. 1942- Impossibility of distributed consensus with one faulty process Asynchronous computers dtict Asynchronous systems dtict Binary arithmetic dtict Computations dtict Computer Hardware scgdst Computer Systems scgdst Configurations dtict Data management dtict Data processing dtict Distributed data processing dtict Fault tolerant computing dtict Message processing dtict Problem solving dtict Reliability dtict Value dtict Datenverarbeitung Fehlertoleranz (DE-588)4123192-2 gnd Verteiltes Datenbanksystem (DE-588)4121865-6 gnd |
| subject_GND | (DE-588)4123192-2 (DE-588)4121865-6 |
| title | Impossibility of distributed consensus with one faulty process |
| title_auth | Impossibility of distributed consensus with one faulty process |
| title_exact_search | Impossibility of distributed consensus with one faulty process |
| title_full | Impossibility of distributed consensus with one faulty process Michael J. Fischer ; Nancy A. Lynch and Michael S. Paterson |
| title_fullStr | Impossibility of distributed consensus with one faulty process Michael J. Fischer ; Nancy A. Lynch and Michael S. Paterson |
| title_full_unstemmed | Impossibility of distributed consensus with one faulty process Michael J. Fischer ; Nancy A. Lynch and Michael S. Paterson |
| title_short | Impossibility of distributed consensus with one faulty process |
| title_sort | impossibility of distributed consensus with one faulty process |
| topic | Asynchronous computers dtict Asynchronous systems dtict Binary arithmetic dtict Computations dtict Computer Hardware scgdst Computer Systems scgdst Configurations dtict Data management dtict Data processing dtict Distributed data processing dtict Fault tolerant computing dtict Message processing dtict Problem solving dtict Reliability dtict Value dtict Datenverarbeitung Fehlertoleranz (DE-588)4123192-2 gnd Verteiltes Datenbanksystem (DE-588)4121865-6 gnd |
| topic_facet | Asynchronous computers Asynchronous systems Binary arithmetic Computations Computer Hardware Computer Systems Configurations Data management Data processing Distributed data processing Fault tolerant computing Message processing Problem solving Reliability Value Datenverarbeitung Fehlertoleranz Verteiltes Datenbanksystem |
| work_keys_str_mv | AT fischermichaelj impossibilityofdistributedconsensuswithonefaultyprocess AT lynchnancya impossibilityofdistributedconsensuswithonefaultyprocess AT patersonmichaels impossibilityofdistributedconsensuswithonefaultyprocess |