A quorum based commit protocol:
Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradatio...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Ithaca, New York
1982
|
Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
483 |
Zusammenfassung: | Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradation in performance. The protocols use a weighted voting scheme that supports an arbitrary degree of data replication (including none) and allows unilaterally aborts by any site. This last property facilitates the integration of these protocols with concurrency control protocols. Both protocols are centralized protocols with low message overhead. |
Beschreibung: | 12 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010581735 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 960123s1982 |||| 00||| engod | ||
035 | |a (OCoLC)9213144 | ||
035 | |a (DE-599)BVBBV010581735 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
050 | 0 | |a TK5105.5 | |
100 | 1 | |a Skeen, Dale |e Verfasser |4 aut | |
245 | 1 | 0 | |a A quorum based commit protocol |
264 | 1 | |a Ithaca, New York |c 1982 | |
300 | |a 12 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 483 | |
520 | 3 | |a Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradation in performance. The protocols use a weighted voting scheme that supports an arbitrary degree of data replication (including none) and allows unilaterally aborts by any site. This last property facilitates the integration of these protocols with concurrency control protocols. Both protocols are centralized protocols with low message overhead. | |
810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 483 |w (DE-604)BV006185504 |9 483 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007054730 |
Datensatz im Suchindex
_version_ | 1804125050665697280 |
---|---|
any_adam_object | |
author | Skeen, Dale |
author_facet | Skeen, Dale |
author_role | aut |
author_sort | Skeen, Dale |
author_variant | d s ds |
building | Verbundindex |
bvnumber | BV010581735 |
callnumber-first | T - Technology |
callnumber-label | TK5105 |
callnumber-raw | TK5105.5 |
callnumber-search | TK5105.5 |
callnumber-sort | TK 45105.5 |
callnumber-subject | TK - Electrical and Nuclear Engineering |
ctrlnum | (OCoLC)9213144 (DE-599)BVBBV010581735 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01534nam a2200289 cb4500</leader><controlfield tag="001">BV010581735</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960123s1982 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)9213144</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010581735</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="050" ind1=" " ind2="0"><subfield code="a">TK5105.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Skeen, Dale</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A quorum based commit protocol</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">483</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradation in performance. The protocols use a weighted voting scheme that supports an arbitrary degree of data replication (including none) and allows unilaterally aborts by any site. This last property facilitates the integration of these protocols with concurrency control protocols. Both protocols are centralized protocols with low message overhead.</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">483</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">483</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007054730</subfield></datafield></record></collection> |
id | DE-604.BV010581735 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:55:24Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007054730 |
oclc_num | 9213144 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 12 S. |
publishDate | 1982 |
publishDateSearch | 1982 |
publishDateSort | 1982 |
record_format | marc |
series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
spelling | Skeen, Dale Verfasser aut A quorum based commit protocol Ithaca, New York 1982 12 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 483 Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradation in performance. The protocols use a weighted voting scheme that supports an arbitrary degree of data replication (including none) and allows unilaterally aborts by any site. This last property facilitates the integration of these protocols with concurrency control protocols. Both protocols are centralized protocols with low message overhead. Department of Computer Science: Technical report Cornell University <Ithaca, NY> 483 (DE-604)BV006185504 483 |
spellingShingle | Skeen, Dale A quorum based commit protocol |
title | A quorum based commit protocol |
title_auth | A quorum based commit protocol |
title_exact_search | A quorum based commit protocol |
title_full | A quorum based commit protocol |
title_fullStr | A quorum based commit protocol |
title_full_unstemmed | A quorum based commit protocol |
title_short | A quorum based commit protocol |
title_sort | a quorum based commit protocol |
volume_link | (DE-604)BV006185504 |
work_keys_str_mv | AT skeendale aquorumbasedcommitprotocol |