Self-stabilizing reconfiguration
| Autor: | Dolev, S., Georgiou, Chryssis, Marcoullis, Ioannis, Schiller, E. M. |
|---|---|
| Přispěvatelé: | El Abbadi A., Garbinato B., Georgiou, Chryssis [0000-0003-4360-0260], Marcoullis, Ioannis [0000-0001-7510-7927] |
| Rok vydání: | 2017 |
| Předmět: |
FOS: Computer and information sciences
State machine replication Computer science Reliability (computer networking) Distributed computing Liveness Self-stabilization 0102 computer and information sciences 02 engineering and technology Virtual synchrony 01 natural sciences GeneralLiterature_MISCELLANEOUS Reconfiguration schemes 03 medical and health sciences Consistency (database systems) 0302 clinical medicine 020204 information systems 0202 electrical engineering electronic engineering information engineering Failure Detectors Stabilizing solutions ComputingMilieux_THECOMPUTINGPROFESSION System designers Message passing Control reconfiguration 020206 networking & telecommunications Fault tolerance Finite difference method Fault-tolerance Computer Science - Distributed Parallel and Cluster Computing Churn rate 010201 computation theory & mathematics 030220 oncology & carcinogenesis Reconfiguration Transient faults Message passing systems Distributed Parallel and Cluster Computing (cs.DC) |
| Zdroj: | 5th International Conference on Networked Systems, NETYS 2017 Lect. Notes Comput. Sci. Middleware Posters and Demos Networked Systems ISBN: 9783319596464 NETYS Proceedings of the Posters and Demos Session of the ACM/IFIP/USENIX Middleware 2016 Conference, Middleware Posters and Demos 2016 ACM/IFIP/USENIX International Middleware Conference, Middleware Posters and Demos 2016 |
| Popis: | Current reconfiguration techniques are based on starting the system in a consistent configuration, in which all participating entities are in their initial state. Starting from that state, the system must preserve consistency as long as a predefined churn rate of processors joins and leaves is not violated, and unbounded storage is available. Many working systems cannot control this churn rate and do not have access to unbounded storage. System designers that neglect the outcome of violating the above assumptions may doom the system to exhibit illegal behaviors. We present the first automatically recovering reconfiguration scheme that recovers from transient faults, such as temporal violations of the above assumptions. Our self-stabilizing solutions regain safety automatically by assuming temporal access to reliable failure detectors. Once safety is re-established, the failure detector reliability is no longer needed. Still, liveness is conditioned by the failure detector's unreliable signals. We show that our self-stabilizing reconfiguration techniques can serve as the basis for the implementation of several dynamic services over message passing systems. Examples include self-stabilizing reconfigurable virtual synchrony, which, in turn, can be used for implementing a self-stabilizing reconfigurable state-machine replication and self-stabilizing reconfigurable emulation of shared memory. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|