On system rollback and totalised fields
| Title: | On system rollback and totalised fields |
|---|---|
| Authors: | Burgess, Mark, Couch, Alva |
| Source: | Journal of Logic and Algebraic Programming 80 (2011), pp. 427-443 |
| Publication Year: | 2021 |
| Collection: | Computer Science |
| Subject Terms: | Computer Science - Distributed, Parallel, and Cluster Computing, F.3.0, I.1.0, H.0, K.6.4 |
| More Details: | In system operations it is commonly assumed that arbitrary changes to a system can be reversed or `rolled back', when errors of judgement and procedure occur. We point out that this view is flawed and provide an alternative approach to determining the outcome of changes. Convergent operators are fixed-point generators that stem from the basic properties of multiplication by zero. They are capable of yielding a repeated and predictable outcome even in an incompletely specified or `open' system. We formulate such `convergent operators' for configuration change in the language of groups and rings and show that, in this form, the problem of convergent reversibility becomes equivalent to the `division by zero' problem. Hence, we discuss how recent work by Bergstra and Tucker on zero-totalised fields helps to clear up long-standing confusion about the options for `rollback' in change management. |
| Document Type: | Working Paper |
| DOI: | 10.1016/j.jlap.2011.07.001 |
| Access URL: | http://arxiv.org/abs/2104.11958 |
| Accession Number: | edsarx.2104.11958 |
| Database: | arXiv |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://arxiv.org/abs/2104.11958 Name: EDS - Arxiv Category: fullText Text: View this record from Arxiv MouseOverText: View this record from Arxiv – Url: https://resolver.ebsco.com/c/xy5jbn/result?sid=EBSCO:edsarx&genre=article&issn=&ISBN=&volume=&issue=&date=20210424&spage=&pages=&title=On system rollback and totalised fields&atitle=On%20system%20rollback%20and%20totalised%20fields&aulast=Burgess%2C%20Mark&id=DOI:10.1016/j.jlap.2011.07.001 Name: Full Text Finder (for New FTF UI) (s8985755) Category: fullText Text: Find It @ SCU Libraries MouseOverText: Find It @ SCU Libraries |
|---|---|
| Header | DbId: edsarx DbLabel: arXiv An: edsarx.2104.11958 RelevancyScore: 1014 AccessLevel: 3 PubType: Report PubTypeId: report PreciseRelevancyScore: 1013.71368408203 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On system rollback and totalised fields – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Burgess%2C+Mark%22">Burgess, Mark</searchLink><br /><searchLink fieldCode="AR" term="%22Couch%2C+Alva%22">Couch, Alva</searchLink> – Name: TitleSource Label: Source Group: Src Data: Journal of Logic and Algebraic Programming 80 (2011), pp. 427-443 – Name: DatePubCY Label: Publication Year Group: Date Data: 2021 – Name: Subset Label: Collection Group: HoldingsInfo Data: Computer Science – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Computer+Science+-+Distributed%2C+Parallel%2C+and+Cluster+Computing%22">Computer Science - Distributed, Parallel, and Cluster Computing</searchLink><br /><searchLink fieldCode="DE" term="%22F%2E3%2E0%22">F.3.0</searchLink><br /><searchLink fieldCode="DE" term="%22I%2E1%2E0%22">I.1.0</searchLink><br /><searchLink fieldCode="DE" term="%22H%2E0%22">H.0</searchLink><br /><searchLink fieldCode="DE" term="%22K%2E6%2E4%22">K.6.4</searchLink> – Name: Abstract Label: Description Group: Ab Data: In system operations it is commonly assumed that arbitrary changes to a system can be reversed or `rolled back', when errors of judgement and procedure occur. We point out that this view is flawed and provide an alternative approach to determining the outcome of changes. Convergent operators are fixed-point generators that stem from the basic properties of multiplication by zero. They are capable of yielding a repeated and predictable outcome even in an incompletely specified or `open' system. We formulate such `convergent operators' for configuration change in the language of groups and rings and show that, in this form, the problem of convergent reversibility becomes equivalent to the `division by zero' problem. Hence, we discuss how recent work by Bergstra and Tucker on zero-totalised fields helps to clear up long-standing confusion about the options for `rollback' in change management. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Working Paper – Name: DOI Label: DOI Group: ID Data: 10.1016/j.jlap.2011.07.001 – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="http://arxiv.org/abs/2104.11958" linkWindow="_blank">http://arxiv.org/abs/2104.11958</link> – Name: AN Label: Accession Number Group: ID Data: edsarx.2104.11958 |
| PLink | https://login.libproxy.scu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2104.11958 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.jlap.2011.07.001 Subjects: – SubjectFull: Computer Science - Distributed, Parallel, and Cluster Computing Type: general – SubjectFull: F.3.0 Type: general – SubjectFull: I.1.0 Type: general – SubjectFull: H.0 Type: general – SubjectFull: K.6.4 Type: general Titles: – TitleFull: On system rollback and totalised fields Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Burgess, Mark – PersonEntity: Name: NameFull: Couch, Alva IsPartOfRelationships: – BibEntity: Dates: – D: 24 M: 04 Type: published Y: 2021 |
| ResultId | 1 |