Becker, 1991 - Google Patents
Keeping processes under surveillanceBecker, 1991
- Document ID
- 6440485191500540759
- Author
- Becker T
- Publication year
- Publication venue
- [1991] Proceedings Tenth Symposium on Reliable Distributed Systems
External Links
Snippet
Two solutions for the surveillance problem that are based on an election algorithm which has to cope with process and communication failures are described. The election algorithm is presented in detail. The surveillance algorithms are simple and efficient: the central crash …
- 238000000034 method 0 title abstract description 183
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F11/202—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where processing functionality is redundant
- G06F11/2023—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where processing functionality is redundant details of failing over
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F11/2097—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements maintaining the standby controller/processing unit updated
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1479—Generic software techniques for error detection or fault masking
- G06F11/1482—Generic software techniques for error detection or fault masking by means of middleware or OS functionality
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce, e.g. shopping or e-commerce
- G06Q30/06—Buying, selling or leasing transactions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L29/00—Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00 contains provisionally no documents
- H04L29/02—Communication control; Communication processing contains provisionally no documents
- H04L29/06—Communication control; Communication processing contains provisionally no documents characterised by a protocol
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Application independent communication protocol aspects or techniques in packet data networks
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—High level architectural aspects of 7-layer open systems interconnection [OSI] type protocol stacks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Application independent communication protocol aspects or techniques in packet data networks
- H04L69/40—Techniques for recovering from a failure of a protocol instance or entity, e.g. failover routines, service redundancy protocols, protocol state redundancy or protocol service redirection in case of a failure or disaster recovery
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Cristian et al. | A timestamp-based checkpointing protocol for long-lived distributed computations | |
| Thambidurai et al. | Interactive consistency with multiple failure modes | |
| Barret et al. | The Delta-4 extra performance architecture (XPA) | |
| Venkatesan | Message-optimal incremental snapshots | |
| Cristian | Agreeing on who is present and who is absent in a synchronous distributed system | |
| Ladin et al. | Garbage collection of a distributed heap | |
| Becker | Keeping processes under surveillance | |
| Melliar-Smith et al. | Fault-tolerant distributed systems based on broadcast communication | |
| Ramanathan et al. | Checkpointing and rollback recovery in a distributed system using common time base | |
| Chow et al. | An optimal distributed algorithm for failure-driven leader election in bounded-degree networks | |
| Neilsen et al. | A general method to define quorums | |
| Echtle | Distance agreement protocols | |
| Kim et al. | A robust, distributed election protocol | |
| Rothermel et al. | Open commit protocols for the tree of processes model | |
| Agrawal et al. | An efficient protocol for voting in distributed systems | |
| Pfluegl et al. | Evaluation of a new algorithm for fault-tolerant clock synchronization | |
| Tsay et al. | A real-time algorithm for fair interprocess synchronization | |
| Israel et al. | A non-intrusive checkpointing protocol | |
| Kim et al. | Approaches to implementation of multiple DRB stations in tightly-coupled computer networks | |
| Jang | Reliable broadcasting algorithm for a cube-connected cycles network | |
| Hwang et al. | Asynchronous recovery protocols for distributed systems | |
| Nakajima | Using a finite projective plane with a duality for decentralized consensus protocols | |
| Al-Dhelaan et al. | Efficient fault tolerant broadcasting algorithm for the cube-connected cycles network | |
| Hsieh | Decentralized evaluation of associative and commutative functions | |
| Huang et al. | Availability analysis of the primary site approach for fault tolerance |