Wait free consensus:
Abstract: "Consensus is a decision problem in which n processors, each starting with a value not known to the others, must collectively agree on a single value. If the initial values are equal, the processors must agree on that common value; this is the validity condition. A consensus protocol...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pittsburgh, PA
School of Computer Science, Carnegie Mellon Univ.
1992
|
| Schriftenreihe: | School of Computer Science <Pittsburgh, Pa.>: CMU-CS
1992,164 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Consensus is a decision problem in which n processors, each starting with a value not known to the others, must collectively agree on a single value. If the initial values are equal, the processors must agree on that common value; this is the validity condition. A consensus protocol is wait-free if every processor finishes in a finite number of its own steps regardless of the relative speeds of the other processors, a condition that precludes the use of traditonal synchronization techniques such as critical sections, locking, or leader election. Wait-free consensus is fundamental to synchronization without mutual exclusion, as it can be used to construct wait-free implementations of arbitrary concurrent data structures It is known that no deterministic algorithm for wait-free consensus is possible, although many randomized algorithms have been proposed. I present two algorithms for solving the wait-free consensus problem in the standard asynchronous shared-memory model. The first is a very simple protocol based on a random walk. The second is a protocol based on weighted voting, in which each processor executes O(n log p2 sn) expected operations. This bound is close to the trivial lower bound of [Omega](n), and it substantially improves on the best previously-known bound of O(n p2 slog n), due to Bracha and Rachman. |
| Beschreibung: | Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 |
| Beschreibung: | V, 70 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010175636 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950510s1992 m||| 00||| eng d | ||
| 035 | |a (OCoLC)26847341 | ||
| 035 | |a (DE-599)BVBBV010175636 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 082 | 0 | |a 510.7808 |b C28r 92-164 | |
| 084 | |a MAT 605d |2 stub | ||
| 084 | |a DAT 212d |2 stub | ||
| 084 | |a ELT 556d |2 stub | ||
| 088 | |a CMU CS 92 164 | ||
| 100 | 1 | |a Aspnes, James |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Wait free consensus |c James Aspnes |
| 246 | 1 | 3 | |a CMU CS 92 164 |
| 246 | 1 | 3 | |a Wait-free consensus |
| 264 | 1 | |a Pittsburgh, PA |b School of Computer Science, Carnegie Mellon Univ. |c 1992 | |
| 300 | |a V, 70 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1992,164 | |
| 500 | |a Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 | ||
| 520 | 3 | |a Abstract: "Consensus is a decision problem in which n processors, each starting with a value not known to the others, must collectively agree on a single value. If the initial values are equal, the processors must agree on that common value; this is the validity condition. A consensus protocol is wait-free if every processor finishes in a finite number of its own steps regardless of the relative speeds of the other processors, a condition that precludes the use of traditonal synchronization techniques such as critical sections, locking, or leader election. Wait-free consensus is fundamental to synchronization without mutual exclusion, as it can be used to construct wait-free implementations of arbitrary concurrent data structures | |
| 520 | 3 | |a It is known that no deterministic algorithm for wait-free consensus is possible, although many randomized algorithms have been proposed. I present two algorithms for solving the wait-free consensus problem in the standard asynchronous shared-memory model. The first is a very simple protocol based on a random walk. The second is a protocol based on weighted voting, in which each processor executes O(n log p2 sn) expected operations. This bound is close to the trivial lower bound of [Omega](n), and it substantially improves on the best previously-known bound of O(n p2 slog n), due to Bracha and Rachman. | |
| 650 | 4 | |a Multiprocessors | |
| 650 | 4 | |a Synchronization | |
| 650 | 0 | 7 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Martingal |0 (DE-588)4126466-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Synchronisierung |0 (DE-588)4130847-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |D s |
| 689 | 0 | 1 | |a Synchronisierung |0 (DE-588)4130847-5 |D s |
| 689 | 0 | 2 | |a Martingal |0 (DE-588)4126466-6 |D s |
| 689 | 0 | 3 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1992,164 |w (DE-604)BV006187264 |9 1992,164 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006758421 | ||
Datensatz im Suchindex
| _version_ | 1804124572812836864 |
|---|---|
| any_adam_object | |
| author | Aspnes, James |
| author_facet | Aspnes, James |
| author_role | aut |
| author_sort | Aspnes, James |
| author_variant | j a ja |
| building | Verbundindex |
| bvnumber | BV010175636 |
| classification_tum | MAT 605d DAT 212d ELT 556d |
| ctrlnum | (OCoLC)26847341 (DE-599)BVBBV010175636 |
| dewey-full | 510.7808 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.7808 |
| dewey-search | 510.7808 |
| dewey-sort | 3510.7808 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Elektrotechnik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03145nam a2200529 cb4500</leader><controlfield tag="001">BV010175636</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950510s1992 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26847341</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010175636</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-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 92-164</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 605d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 212d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ELT 556d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CMU CS 92 164</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Aspnes, James</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Wait free consensus</subfield><subfield code="c">James Aspnes</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CMU CS 92 164</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Wait-free consensus</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, PA</subfield><subfield code="b">School of Computer Science, Carnegie Mellon Univ.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">V, 70 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">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1992,164</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Pittsburgh, Pa., Univ., Diss., 1992</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Consensus is a decision problem in which n processors, each starting with a value not known to the others, must collectively agree on a single value. If the initial values are equal, the processors must agree on that common value; this is the validity condition. A consensus protocol is wait-free if every processor finishes in a finite number of its own steps regardless of the relative speeds of the other processors, a condition that precludes the use of traditonal synchronization techniques such as critical sections, locking, or leader election. Wait-free consensus is fundamental to synchronization without mutual exclusion, as it can be used to construct wait-free implementations of arbitrary concurrent data structures</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">It is known that no deterministic algorithm for wait-free consensus is possible, although many randomized algorithms have been proposed. I present two algorithms for solving the wait-free consensus problem in the standard asynchronous shared-memory model. The first is a very simple protocol based on a random walk. The second is a protocol based on weighted voting, in which each processor executes O(n log p2 sn) expected operations. This bound is close to the trivial lower bound of [Omega](n), and it substantially improves on the best previously-known bound of O(n p2 slog n), due to Bracha and Rachman.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Synchronization</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Martingal</subfield><subfield code="0">(DE-588)4126466-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Synchronisierung</subfield><subfield code="0">(DE-588)4130847-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Synchronisierung</subfield><subfield code="0">(DE-588)4130847-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Martingal</subfield><subfield code="0">(DE-588)4126466-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1992,164</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">1992,164</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006758421</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010175636 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:48Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006758421 |
| oclc_num | 26847341 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | V, 70 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | School of Computer Science, Carnegie Mellon Univ. |
| record_format | marc |
| series | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| series2 | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| spelling | Aspnes, James Verfasser aut Wait free consensus James Aspnes CMU CS 92 164 Wait-free consensus Pittsburgh, PA School of Computer Science, Carnegie Mellon Univ. 1992 V, 70 S. txt rdacontent n rdamedia nc rdacarrier School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1992,164 Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 Abstract: "Consensus is a decision problem in which n processors, each starting with a value not known to the others, must collectively agree on a single value. If the initial values are equal, the processors must agree on that common value; this is the validity condition. A consensus protocol is wait-free if every processor finishes in a finite number of its own steps regardless of the relative speeds of the other processors, a condition that precludes the use of traditonal synchronization techniques such as critical sections, locking, or leader election. Wait-free consensus is fundamental to synchronization without mutual exclusion, as it can be used to construct wait-free implementations of arbitrary concurrent data structures It is known that no deterministic algorithm for wait-free consensus is possible, although many randomized algorithms have been proposed. I present two algorithms for solving the wait-free consensus problem in the standard asynchronous shared-memory model. The first is a very simple protocol based on a random walk. The second is a protocol based on weighted voting, in which each processor executes O(n log p2 sn) expected operations. This bound is close to the trivial lower bound of [Omega](n), and it substantially improves on the best previously-known bound of O(n p2 slog n), due to Bracha and Rachman. Multiprocessors Synchronization Mehrprozessorsystem (DE-588)4038397-0 gnd rswk-swf Martingal (DE-588)4126466-6 gnd rswk-swf Synchronisierung (DE-588)4130847-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Mehrprozessorsystem (DE-588)4038397-0 s Synchronisierung (DE-588)4130847-5 s Martingal (DE-588)4126466-6 s Algorithmus (DE-588)4001183-5 s DE-604 School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1992,164 (DE-604)BV006187264 1992,164 |
| spellingShingle | Aspnes, James Wait free consensus School of Computer Science <Pittsburgh, Pa.>: CMU-CS Multiprocessors Synchronization Mehrprozessorsystem (DE-588)4038397-0 gnd Martingal (DE-588)4126466-6 gnd Synchronisierung (DE-588)4130847-5 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4038397-0 (DE-588)4126466-6 (DE-588)4130847-5 (DE-588)4001183-5 (DE-588)4113937-9 |
| title | Wait free consensus |
| title_alt | CMU CS 92 164 Wait-free consensus |
| title_auth | Wait free consensus |
| title_exact_search | Wait free consensus |
| title_full | Wait free consensus James Aspnes |
| title_fullStr | Wait free consensus James Aspnes |
| title_full_unstemmed | Wait free consensus James Aspnes |
| title_short | Wait free consensus |
| title_sort | wait free consensus |
| topic | Multiprocessors Synchronization Mehrprozessorsystem (DE-588)4038397-0 gnd Martingal (DE-588)4126466-6 gnd Synchronisierung (DE-588)4130847-5 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Multiprocessors Synchronization Mehrprozessorsystem Martingal Synchronisierung Algorithmus Hochschulschrift |
| volume_link | (DE-604)BV006187264 |
| work_keys_str_mv | AT aspnesjames waitfreeconsensus AT aspnesjames cmucs92164 |