Nested transactions: an approach to reliable distributed computing
We examine how to program a system so that the software continues to work in the face of a variety of failures of parts of the system. The design presented uses the concept of transactions: collections of primitive actions that are indivisible. The indivisibility of transactions insures that consist...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1981
|
| Schlagworte: | |
| Zusammenfassung: | We examine how to program a system so that the software continues to work in the face of a variety of failures of parts of the system. The design presented uses the concept of transactions: collections of primitive actions that are indivisible. The indivisibility of transactions insures that consistent results are obtained even when requests are processed concurrently or failures occur during a request. Our design permits transactions to be nested. Nested transactions provide nested universes of synchronization and recovery from failures. The advantages of nested transactions over single-level transactions are that they provide concurrency control within transactions by serializing subtransactions appropriately, and that they permit parts of a transaction to fail without necessarily aborting the entire transaction. The method for implementing nested transactions described in this report is novel in that it uses locking for concurrency control. We present the necessary algorithms for locking, recovery, distributed commitment, and distributed deadlock detection for a nested transaction system. While the design has not been implemented, it has been simulated. The algorithms are described in a formal notation in an appendix, as well as narratively in the body of the report. |
| Beschreibung: | Zugl.: Diss., 1981 |
| Beschreibung: | 178 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876352 | ||
| 003 | DE-604 | ||
| 005 | 20060630000000.0 | ||
| 007 | t | ||
| 008 | 880307s1981 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227491728 | ||
| 035 | |a (DE-599)BVBBV021876352 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-260 | ||
| 100 | 1 | |a Moss, John E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Nested transactions |b an approach to reliable distributed computing |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1981 | |
| 300 | |a 178 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Zugl.: Diss., 1981 | ||
| 520 | 3 | |a We examine how to program a system so that the software continues to work in the face of a variety of failures of parts of the system. The design presented uses the concept of transactions: collections of primitive actions that are indivisible. The indivisibility of transactions insures that consistent results are obtained even when requests are processed concurrently or failures occur during a request. Our design permits transactions to be nested. Nested transactions provide nested universes of synchronization and recovery from failures. The advantages of nested transactions over single-level transactions are that they provide concurrency control within transactions by serializing subtransactions appropriately, and that they permit parts of a transaction to fail without necessarily aborting the entire transaction. The method for implementing nested transactions described in this report is novel in that it uses locking for concurrency control. We present the necessary algorithms for locking, recovery, distributed commitment, and distributed deadlock detection for a nested transaction system. While the design has not been implemented, it has been simulated. The algorithms are described in a formal notation in an appendix, as well as narratively in the body of the report. | |
| 650 | 7 | |a Adaptive systems |2 dtict | |
| 650 | 7 | |a Command and control systems |2 dtict | |
| 650 | 7 | |a Communications networks |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Computer Systems |2 scgdst | |
| 650 | 7 | |a Computer architecture |2 dtict | |
| 650 | 7 | |a Computer communications |2 dtict | |
| 650 | 7 | |a Computer programming |2 dtict | |
| 650 | 7 | |a Computer programs |2 dtict | |
| 650 | 7 | |a Data management |2 dtict | |
| 650 | 7 | |a Executive routines |2 dtict | |
| 650 | 7 | |a Failure |2 dtict | |
| 650 | 7 | |a Fault tolerant computing |2 dtict | |
| 650 | 7 | |a Multiprocessors |2 dtict | |
| 650 | 7 | |a Network flows |2 dtict | |
| 650 | 7 | |a Nodes |2 dtict | |
| 650 | 7 | |a Reliability |2 dtict | |
| 650 | 7 | |a Synchronization(electronics) |2 dtict | |
| 650 | 7 | |a Topology |2 dtict | |
| 650 | 0 | 7 | |a Verteiltes System |0 (DE-588)4238872-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zuverlässigkeit |0 (DE-588)4059245-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenfernverarbeitung |0 (DE-588)4132820-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Dezentrale Datenverarbeitung |0 (DE-588)7545389-7 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Datenfernverarbeitung |0 (DE-588)4132820-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Dezentrale Datenverarbeitung |0 (DE-588)7545389-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 2 | 1 | |a Zuverlässigkeit |0 (DE-588)4059245-5 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091971 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804135815825063936 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Moss, John E. |
| author_facet | Moss, John E. |
| author_role | aut |
| author_sort | Moss, John E. |
| author_variant | j e m je jem |
| building | Verbundindex |
| bvnumber | BV021876352 |
| ctrlnum | (OCoLC)227491728 (DE-599)BVBBV021876352 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03756nam a2200685zc 4500</leader><controlfield tag="001">BV021876352</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060630000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880307s1981 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227491728</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876352</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-260</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Moss, John E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Nested transactions</subfield><subfield code="b">an approach to reliable distributed computing</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">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">178 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="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Diss., 1981</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We examine how to program a system so that the software continues to work in the face of a variety of failures of parts of the system. The design presented uses the concept of transactions: collections of primitive actions that are indivisible. The indivisibility of transactions insures that consistent results are obtained even when requests are processed concurrently or failures occur during a request. Our design permits transactions to be nested. Nested transactions provide nested universes of synchronization and recovery from failures. The advantages of nested transactions over single-level transactions are that they provide concurrency control within transactions by serializing subtransactions appropriately, and that they permit parts of a transaction to fail without necessarily aborting the entire transaction. The method for implementing nested transactions described in this report is novel in that it uses locking for concurrency control. We present the necessary algorithms for locking, recovery, distributed commitment, and distributed deadlock detection for a nested transaction system. While the design has not been implemented, it has been simulated. The algorithms are described in a formal notation in an appendix, as well as narratively in the body of the report.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Adaptive systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Command and control systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Communications networks</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 Programming and Software</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">Computer architecture</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer communications</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programming</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programs</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">Executive routines</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Failure</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">Multiprocessors</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Network flows</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Nodes</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">Topology</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zuverlässigkeit</subfield><subfield code="0">(DE-588)4059245-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenfernverarbeitung</subfield><subfield code="0">(DE-588)4132820-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dezentrale Datenverarbeitung</subfield><subfield code="0">(DE-588)7545389-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><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">Datenfernverarbeitung</subfield><subfield code="0">(DE-588)4132820-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">Dezentrale Datenverarbeitung</subfield><subfield code="0">(DE-588)7545389-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Zuverlässigkeit</subfield><subfield code="0">(DE-588)4059245-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091971</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021876352 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:36Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091971 |
| oclc_num | 227491728 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 178 S. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Moss, John E. Verfasser aut Nested transactions an approach to reliable distributed computing Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1981 178 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Diss., 1981 We examine how to program a system so that the software continues to work in the face of a variety of failures of parts of the system. The design presented uses the concept of transactions: collections of primitive actions that are indivisible. The indivisibility of transactions insures that consistent results are obtained even when requests are processed concurrently or failures occur during a request. Our design permits transactions to be nested. Nested transactions provide nested universes of synchronization and recovery from failures. The advantages of nested transactions over single-level transactions are that they provide concurrency control within transactions by serializing subtransactions appropriately, and that they permit parts of a transaction to fail without necessarily aborting the entire transaction. The method for implementing nested transactions described in this report is novel in that it uses locking for concurrency control. We present the necessary algorithms for locking, recovery, distributed commitment, and distributed deadlock detection for a nested transaction system. While the design has not been implemented, it has been simulated. The algorithms are described in a formal notation in an appendix, as well as narratively in the body of the report. Adaptive systems dtict Command and control systems dtict Communications networks dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Computer architecture dtict Computer communications dtict Computer programming dtict Computer programs dtict Data management dtict Executive routines dtict Failure dtict Fault tolerant computing dtict Multiprocessors dtict Network flows dtict Nodes dtict Reliability dtict Synchronization(electronics) dtict Topology dtict Verteiltes System (DE-588)4238872-7 gnd rswk-swf Zuverlässigkeit (DE-588)4059245-5 gnd rswk-swf Datenfernverarbeitung (DE-588)4132820-6 gnd rswk-swf Dezentrale Datenverarbeitung (DE-588)7545389-7 gnd rswk-swf 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Datenfernverarbeitung (DE-588)4132820-6 s DE-604 Dezentrale Datenverarbeitung (DE-588)7545389-7 s Verteiltes System (DE-588)4238872-7 s Zuverlässigkeit (DE-588)4059245-5 s 2\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Moss, John E. Nested transactions an approach to reliable distributed computing Adaptive systems dtict Command and control systems dtict Communications networks dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Computer architecture dtict Computer communications dtict Computer programming dtict Computer programs dtict Data management dtict Executive routines dtict Failure dtict Fault tolerant computing dtict Multiprocessors dtict Network flows dtict Nodes dtict Reliability dtict Synchronization(electronics) dtict Topology dtict Verteiltes System (DE-588)4238872-7 gnd Zuverlässigkeit (DE-588)4059245-5 gnd Datenfernverarbeitung (DE-588)4132820-6 gnd Dezentrale Datenverarbeitung (DE-588)7545389-7 gnd |
| subject_GND | (DE-588)4238872-7 (DE-588)4059245-5 (DE-588)4132820-6 (DE-588)7545389-7 (DE-588)4113937-9 |
| title | Nested transactions an approach to reliable distributed computing |
| title_auth | Nested transactions an approach to reliable distributed computing |
| title_exact_search | Nested transactions an approach to reliable distributed computing |
| title_exact_search_txtP | Nested transactions an approach to reliable distributed computing |
| title_full | Nested transactions an approach to reliable distributed computing |
| title_fullStr | Nested transactions an approach to reliable distributed computing |
| title_full_unstemmed | Nested transactions an approach to reliable distributed computing |
| title_short | Nested transactions |
| title_sort | nested transactions an approach to reliable distributed computing |
| title_sub | an approach to reliable distributed computing |
| topic | Adaptive systems dtict Command and control systems dtict Communications networks dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Computer architecture dtict Computer communications dtict Computer programming dtict Computer programs dtict Data management dtict Executive routines dtict Failure dtict Fault tolerant computing dtict Multiprocessors dtict Network flows dtict Nodes dtict Reliability dtict Synchronization(electronics) dtict Topology dtict Verteiltes System (DE-588)4238872-7 gnd Zuverlässigkeit (DE-588)4059245-5 gnd Datenfernverarbeitung (DE-588)4132820-6 gnd Dezentrale Datenverarbeitung (DE-588)7545389-7 gnd |
| topic_facet | Adaptive systems Command and control systems Communications networks Computer Hardware Computer Programming and Software Computer Systems Computer architecture Computer communications Computer programming Computer programs Data management Executive routines Failure Fault tolerant computing Multiprocessors Network flows Nodes Reliability Synchronization(electronics) Topology Verteiltes System Zuverlässigkeit Datenfernverarbeitung Dezentrale Datenverarbeitung Hochschulschrift |
| work_keys_str_mv | AT mossjohne nestedtransactionsanapproachtoreliabledistributedcomputing |