Transaction commit in a realistic timing model:
An important problem in the construction of fault-tolerant distributed database systems is the design of nonblocking transaction commit protocols. This problem has been extensively studied for synchronous systems (i.e., systems where no messages ever arrive late). In this paper, the synchrony assump...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1988
|
| Subjects: | |
| Summary: | An important problem in the construction of fault-tolerant distributed database systems is the design of nonblocking transaction commit protocols. This problem has been extensively studied for synchronous systems (i.e., systems where no messages ever arrive late). In this paper, the synchrony assumption is relaxed. A new partially synchronous timing model is given. In this model, a new nonblocking randomized transaction commit protocol is given, based on a Byzantine agreement protocol of Ben-Or. The new protocol works as long as fewer than half the processor fail. A lower bound is proved, showing that the number of processor faults tolerated is optimal. The protocol exhibits a graceful degradation property: when more than half the processors fail, the protocol blocks, but not processor produces a wrong answer. A notion of asynchronous round is defined and the protocol is shown to terminate in a small constant expected number of asynchronous rounds. The final result is that no protocol in this model can terminate in a bounded expected number of steps, even if processors are synchronous. (KR). |
| Physical Description: | 38 S. |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021892002 | ||
| 003 | DE-604 | ||
| 005 | 20190801 | ||
| 007 | t | ||
| 008 | 900720s1988 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227722996 | ||
| 035 | |a (DE-599)BVBBV021892002 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-360 | ||
| 100 | 1 | |a Coan, Brian A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Transaction commit in a realistic timing model |c Brian A. Coan ; Jennifer Ludelius Welch |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1988 | |
| 300 | |a 38 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a An important problem in the construction of fault-tolerant distributed database systems is the design of nonblocking transaction commit protocols. This problem has been extensively studied for synchronous systems (i.e., systems where no messages ever arrive late). In this paper, the synchrony assumption is relaxed. A new partially synchronous timing model is given. In this model, a new nonblocking randomized transaction commit protocol is given, based on a Byzantine agreement protocol of Ben-Or. The new protocol works as long as fewer than half the processor fail. A lower bound is proved, showing that the number of processor faults tolerated is optimal. The protocol exhibits a graceful degradation property: when more than half the processors fail, the protocol blocks, but not processor produces a wrong answer. A notion of asynchronous round is defined and the protocol is shown to terminate in a small constant expected number of asynchronous rounds. The final result is that no protocol in this model can terminate in a bounded expected number of steps, even if processors are synchronous. (KR). | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Data bases |2 dtict | |
| 650 | 7 | |a Degradation |2 dtict | |
| 650 | 7 | |a Distributed data processing |2 dtict | |
| 650 | 7 | |a Fault tolerant computing |2 dtict | |
| 650 | 7 | |a Models |2 dtict | |
| 650 | 7 | |a Processing equipment |2 dtict | |
| 650 | 7 | |a Synchronism |2 dtict | |
| 650 | 7 | |a Systems engineering |2 dtict | |
| 650 | 7 | |a Time |2 dtict | |
| 650 | 0 | 7 | |a Verteiltes Datenbanksystem |0 (DE-588)4121865-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Fehlertoleranz |0 (DE-588)4123192-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Verteiltes Datenbanksystem |0 (DE-588)4121865-6 |D s |
| 689 | 0 | 1 | |a Fehlertoleranz |0 (DE-588)4123192-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Welch, Jennifer Lundelius |e Verfasser |0 (DE-588)1089587988 |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015107200 | ||
Record in the Search Index
| _version_ | 1804135835523612672 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Coan, Brian A. Welch, Jennifer Lundelius |
| author_GND | (DE-588)1089587988 |
| author_facet | Coan, Brian A. Welch, Jennifer Lundelius |
| author_role | aut aut |
| author_sort | Coan, Brian A. |
| author_variant | b a c ba bac j l w jl jlw |
| building | Verbundindex |
| bvnumber | BV021892002 |
| ctrlnum | (OCoLC)227722996 (DE-599)BVBBV021892002 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02631nam a2200457zc 4500</leader><controlfield tag="001">BV021892002</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190801 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900720s1988 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227722996</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021892002</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/TM-360</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Coan, Brian A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Transaction commit in a realistic timing model</subfield><subfield code="c">Brian A. Coan ; Jennifer Ludelius Welch</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">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38 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">An important problem in the construction of fault-tolerant distributed database systems is the design of nonblocking transaction commit protocols. This problem has been extensively studied for synchronous systems (i.e., systems where no messages ever arrive late). In this paper, the synchrony assumption is relaxed. A new partially synchronous timing model is given. In this model, a new nonblocking randomized transaction commit protocol is given, based on a Byzantine agreement protocol of Ben-Or. The new protocol works as long as fewer than half the processor fail. A lower bound is proved, showing that the number of processor faults tolerated is optimal. The protocol exhibits a graceful degradation property: when more than half the processors fail, the protocol blocks, but not processor produces a wrong answer. A notion of asynchronous round is defined and the protocol is shown to terminate in a small constant expected number of asynchronous rounds. The final result is that no protocol in this model can terminate in a bounded expected number of steps, even if processors are synchronous. (KR).</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">Data bases</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Degradation</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">Models</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Processing equipment</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Synchronism</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Systems engineering</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Time</subfield><subfield code="2">dtict</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="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="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="1"><subfield code="a">Fehlertoleranz</subfield><subfield code="0">(DE-588)4123192-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Welch, Jennifer Lundelius</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089587988</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015107200</subfield></datafield></record></collection> |
| id | DE-604.BV021892002 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:04:12Z |
| indexdate | 2024-07-09T20:46:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015107200 |
| oclc_num | 227722996 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 38 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Coan, Brian A. Verfasser aut Transaction commit in a realistic timing model Brian A. Coan ; Jennifer Ludelius Welch Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1988 38 S. txt rdacontent n rdamedia nc rdacarrier An important problem in the construction of fault-tolerant distributed database systems is the design of nonblocking transaction commit protocols. This problem has been extensively studied for synchronous systems (i.e., systems where no messages ever arrive late). In this paper, the synchrony assumption is relaxed. A new partially synchronous timing model is given. In this model, a new nonblocking randomized transaction commit protocol is given, based on a Byzantine agreement protocol of Ben-Or. The new protocol works as long as fewer than half the processor fail. A lower bound is proved, showing that the number of processor faults tolerated is optimal. The protocol exhibits a graceful degradation property: when more than half the processors fail, the protocol blocks, but not processor produces a wrong answer. A notion of asynchronous round is defined and the protocol is shown to terminate in a small constant expected number of asynchronous rounds. The final result is that no protocol in this model can terminate in a bounded expected number of steps, even if processors are synchronous. (KR). Computer Hardware scgdst Data bases dtict Degradation dtict Distributed data processing dtict Fault tolerant computing dtict Models dtict Processing equipment dtict Synchronism dtict Systems engineering dtict Time dtict Verteiltes Datenbanksystem (DE-588)4121865-6 gnd rswk-swf Fehlertoleranz (DE-588)4123192-2 gnd rswk-swf Verteiltes Datenbanksystem (DE-588)4121865-6 s Fehlertoleranz (DE-588)4123192-2 s DE-604 Welch, Jennifer Lundelius Verfasser (DE-588)1089587988 aut |
| spellingShingle | Coan, Brian A. Welch, Jennifer Lundelius Transaction commit in a realistic timing model Computer Hardware scgdst Data bases dtict Degradation dtict Distributed data processing dtict Fault tolerant computing dtict Models dtict Processing equipment dtict Synchronism dtict Systems engineering dtict Time dtict Verteiltes Datenbanksystem (DE-588)4121865-6 gnd Fehlertoleranz (DE-588)4123192-2 gnd |
| subject_GND | (DE-588)4121865-6 (DE-588)4123192-2 |
| title | Transaction commit in a realistic timing model |
| title_auth | Transaction commit in a realistic timing model |
| title_exact_search | Transaction commit in a realistic timing model |
| title_exact_search_txtP | Transaction commit in a realistic timing model |
| title_full | Transaction commit in a realistic timing model Brian A. Coan ; Jennifer Ludelius Welch |
| title_fullStr | Transaction commit in a realistic timing model Brian A. Coan ; Jennifer Ludelius Welch |
| title_full_unstemmed | Transaction commit in a realistic timing model Brian A. Coan ; Jennifer Ludelius Welch |
| title_short | Transaction commit in a realistic timing model |
| title_sort | transaction commit in a realistic timing model |
| topic | Computer Hardware scgdst Data bases dtict Degradation dtict Distributed data processing dtict Fault tolerant computing dtict Models dtict Processing equipment dtict Synchronism dtict Systems engineering dtict Time dtict Verteiltes Datenbanksystem (DE-588)4121865-6 gnd Fehlertoleranz (DE-588)4123192-2 gnd |
| topic_facet | Computer Hardware Data bases Degradation Distributed data processing Fault tolerant computing Models Processing equipment Synchronism Systems engineering Time Verteiltes Datenbanksystem Fehlertoleranz |
| work_keys_str_mv | AT coanbriana transactioncommitinarealistictimingmodel AT welchjenniferlundelius transactioncommitinarealistictimingmodel |