Robust concurrency control for a distributed information system:
This dissertation presents a collection of protocols for coordinating transactions in a distributed information system. The system is modeled as a collection of processes that communicate only through message passing. Each process manages some portion of the data base, and several processes may coop...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1978
|
Schlagworte: | |
Zusammenfassung: | This dissertation presents a collection of protocols for coordinating transactions in a distributed information system. The system is modeled as a collection of processes that communicate only through message passing. Each process manages some portion of the data base, and several processes may cooperate in performing a single transaction. The thesis presents a model for computation in a distributed information system in which the sites and communication links may fail. The effects of such failures on the computation are described in the model. The thesis discusses implementation techniques that could be used to limit the effects of failures in a real system to those described in the model. A hierarchical protocol for coordinating transactions is presented. The accesses to be performed during a transaction are pre-analyzed to select the protocols needed to coordinate the processes that participate in the implementation of the transaction. This analysis can be used to guide the organization of the data base so as to minimize the amount of locking required in performing frequent or important transactions. An important aspect of this mechanism is that it allows transactions that cannot accurately be pre-analyzed to be performed and correctly synchronized without severely degrading the performance of the system in performing more predictable transactions. A novel approach to the problem of making updates at several different sites atomically is also discussed. This approach is based on the notion of a polyvalue, which is used to represent two or more possible values for a single data item. A polyvalue is created for an item involved in an update that has been delayed due to a failure. |
Beschreibung: | 197 S. |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV021875873 | ||
003 | DE-604 | ||
005 | 20190813 | ||
007 | t | ||
008 | 880222s1978 m||| 00||| eng d | ||
035 | |a (OCoLC)227404150 | ||
035 | |a (DE-599)BVBBV021875873 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
088 | |a MIT/LCS/TR-207 | ||
100 | 1 | |a Montgomery, Warren A. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Robust concurrency control for a distributed information system |
264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1978 | |
300 | |a 197 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
502 | |a Zugl.: Diss., 1978 | ||
520 | 3 | |a This dissertation presents a collection of protocols for coordinating transactions in a distributed information system. The system is modeled as a collection of processes that communicate only through message passing. Each process manages some portion of the data base, and several processes may cooperate in performing a single transaction. The thesis presents a model for computation in a distributed information system in which the sites and communication links may fail. The effects of such failures on the computation are described in the model. The thesis discusses implementation techniques that could be used to limit the effects of failures in a real system to those described in the model. A hierarchical protocol for coordinating transactions is presented. The accesses to be performed during a transaction are pre-analyzed to select the protocols needed to coordinate the processes that participate in the implementation of the transaction. This analysis can be used to guide the organization of the data base so as to minimize the amount of locking required in performing frequent or important transactions. An important aspect of this mechanism is that it allows transactions that cannot accurately be pre-analyzed to be performed and correctly synchronized without severely degrading the performance of the system in performing more predictable transactions. A novel approach to the problem of making updates at several different sites atomically is also discussed. This approach is based on the notion of a polyvalue, which is used to represent two or more possible values for a single data item. A polyvalue is created for an item involved in an update that has been delayed due to a failure. | |
650 | 7 | |a Computer Programming and Software |2 scgdst | |
650 | 7 | |a Control sequences |2 dtict | |
650 | 7 | |a Control systems |2 dtict | |
650 | 7 | |a Data bases |2 dtict | |
650 | 7 | |a Hierarchies |2 dtict | |
650 | 7 | |a Information Science |2 scgdst | |
650 | 7 | |a Information systems |2 dtict | |
650 | 7 | |a Mfg & Industrial Eng & Control of Product Sys |2 scgdst | |
650 | 7 | |a Redundancy |2 dtict | |
650 | 7 | |a Reliability |2 dtict | |
650 | 7 | |a Synchronization(electronics) |2 dtict | |
650 | 7 | |a Theses |2 dtict | |
650 | 0 | 7 | |a Verteiltes Datenbanksystem |0 (DE-588)4121865-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Nebenläufigkeitskontrolle |0 (DE-588)4705801-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Synchronisierung |0 (DE-588)4130847-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Verteiltes Datenbanksystem |0 (DE-588)4121865-6 |D s |
689 | 0 | 1 | |a Nebenläufigkeitskontrolle |0 (DE-588)4705801-8 |D s |
689 | 0 | 2 | |a Synchronisierung |0 (DE-588)4130847-5 |D s |
689 | 0 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015091517 |
Datensatz im Suchindex
_version_ | 1804135815252541440 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Montgomery, Warren A. |
author_facet | Montgomery, Warren A. |
author_role | aut |
author_sort | Montgomery, Warren A. |
author_variant | w a m wa wam |
building | Verbundindex |
bvnumber | BV021875873 |
ctrlnum | (OCoLC)227404150 (DE-599)BVBBV021875873 |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03509nam a2200517zc 4500</leader><controlfield tag="001">BV021875873</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190813 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880222s1978 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227404150</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021875873</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-207</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Montgomery, Warren A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust concurrency control for a distributed information system</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">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">197 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="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Diss., 1978</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This dissertation presents a collection of protocols for coordinating transactions in a distributed information system. The system is modeled as a collection of processes that communicate only through message passing. Each process manages some portion of the data base, and several processes may cooperate in performing a single transaction. The thesis presents a model for computation in a distributed information system in which the sites and communication links may fail. The effects of such failures on the computation are described in the model. The thesis discusses implementation techniques that could be used to limit the effects of failures in a real system to those described in the model. A hierarchical protocol for coordinating transactions is presented. The accesses to be performed during a transaction are pre-analyzed to select the protocols needed to coordinate the processes that participate in the implementation of the transaction. This analysis can be used to guide the organization of the data base so as to minimize the amount of locking required in performing frequent or important transactions. An important aspect of this mechanism is that it allows transactions that cannot accurately be pre-analyzed to be performed and correctly synchronized without severely degrading the performance of the system in performing more predictable transactions. A novel approach to the problem of making updates at several different sites atomically is also discussed. This approach is based on the notion of a polyvalue, which is used to represent two or more possible values for a single data item. A polyvalue is created for an item involved in an update that has been delayed due to a failure.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Control sequences</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Control systems</subfield><subfield code="2">dtict</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">Hierarchies</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information Science</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mfg & Industrial Eng & Control of Product Sys</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Redundancy</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">Synchronization(electronics)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theses</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">Nebenläufigkeitskontrolle</subfield><subfield code="0">(DE-588)4705801-8</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="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">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">Nebenläufigkeitskontrolle</subfield><subfield code="0">(DE-588)4705801-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091517</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV021875873 |
illustrated | Not Illustrated |
index_date | 2024-07-02T16:03:35Z |
indexdate | 2024-07-09T20:46:30Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091517 |
oclc_num | 227404150 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 197 S. |
publishDate | 1978 |
publishDateSearch | 1978 |
publishDateSort | 1978 |
publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
record_format | marc |
spelling | Montgomery, Warren A. Verfasser aut Robust concurrency control for a distributed information system Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1978 197 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Diss., 1978 This dissertation presents a collection of protocols for coordinating transactions in a distributed information system. The system is modeled as a collection of processes that communicate only through message passing. Each process manages some portion of the data base, and several processes may cooperate in performing a single transaction. The thesis presents a model for computation in a distributed information system in which the sites and communication links may fail. The effects of such failures on the computation are described in the model. The thesis discusses implementation techniques that could be used to limit the effects of failures in a real system to those described in the model. A hierarchical protocol for coordinating transactions is presented. The accesses to be performed during a transaction are pre-analyzed to select the protocols needed to coordinate the processes that participate in the implementation of the transaction. This analysis can be used to guide the organization of the data base so as to minimize the amount of locking required in performing frequent or important transactions. An important aspect of this mechanism is that it allows transactions that cannot accurately be pre-analyzed to be performed and correctly synchronized without severely degrading the performance of the system in performing more predictable transactions. A novel approach to the problem of making updates at several different sites atomically is also discussed. This approach is based on the notion of a polyvalue, which is used to represent two or more possible values for a single data item. A polyvalue is created for an item involved in an update that has been delayed due to a failure. Computer Programming and Software scgdst Control sequences dtict Control systems dtict Data bases dtict Hierarchies dtict Information Science scgdst Information systems dtict Mfg & Industrial Eng & Control of Product Sys scgdst Redundancy dtict Reliability dtict Synchronization(electronics) dtict Theses dtict Verteiltes Datenbanksystem (DE-588)4121865-6 gnd rswk-swf Nebenläufigkeitskontrolle (DE-588)4705801-8 gnd rswk-swf Synchronisierung (DE-588)4130847-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Verteiltes Datenbanksystem (DE-588)4121865-6 s Nebenläufigkeitskontrolle (DE-588)4705801-8 s Synchronisierung (DE-588)4130847-5 s DE-604 |
spellingShingle | Montgomery, Warren A. Robust concurrency control for a distributed information system Computer Programming and Software scgdst Control sequences dtict Control systems dtict Data bases dtict Hierarchies dtict Information Science scgdst Information systems dtict Mfg & Industrial Eng & Control of Product Sys scgdst Redundancy dtict Reliability dtict Synchronization(electronics) dtict Theses dtict Verteiltes Datenbanksystem (DE-588)4121865-6 gnd Nebenläufigkeitskontrolle (DE-588)4705801-8 gnd Synchronisierung (DE-588)4130847-5 gnd |
subject_GND | (DE-588)4121865-6 (DE-588)4705801-8 (DE-588)4130847-5 (DE-588)4113937-9 |
title | Robust concurrency control for a distributed information system |
title_auth | Robust concurrency control for a distributed information system |
title_exact_search | Robust concurrency control for a distributed information system |
title_exact_search_txtP | Robust concurrency control for a distributed information system |
title_full | Robust concurrency control for a distributed information system |
title_fullStr | Robust concurrency control for a distributed information system |
title_full_unstemmed | Robust concurrency control for a distributed information system |
title_short | Robust concurrency control for a distributed information system |
title_sort | robust concurrency control for a distributed information system |
topic | Computer Programming and Software scgdst Control sequences dtict Control systems dtict Data bases dtict Hierarchies dtict Information Science scgdst Information systems dtict Mfg & Industrial Eng & Control of Product Sys scgdst Redundancy dtict Reliability dtict Synchronization(electronics) dtict Theses dtict Verteiltes Datenbanksystem (DE-588)4121865-6 gnd Nebenläufigkeitskontrolle (DE-588)4705801-8 gnd Synchronisierung (DE-588)4130847-5 gnd |
topic_facet | Computer Programming and Software Control sequences Control systems Data bases Hierarchies Information Science Information systems Mfg & Industrial Eng & Control of Product Sys Redundancy Reliability Synchronization(electronics) Theses Verteiltes Datenbanksystem Nebenläufigkeitskontrolle Synchronisierung Hochschulschrift |
work_keys_str_mv | AT montgomerywarrena robustconcurrencycontrolforadistributedinformationsystem |