DOCSLIB.ORG

Comprehensive and Efficient Runtime Checking in System Software Through Watchdogs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Comprehensive and Efficient Runtime Checking in System Software Through Watchdogs Comprehensive and Efficient Runtime Checking in System Software through Watchdogs Chang Lou Peng Huang Scott Smith Johns Hopkins University Johns Hopkins University Johns Hopkins University ACM Reference Format: check whether it is functioning properly at runtime and au- Chang Lou, Peng Huang, and Scott Smith. 2019. Comprehensive and tonomously take corrective action when serious problems are Efficient Runtime Checking in System Software through Watchdogs. detected, and this requires effective failure detectors. In Workshop on Hot Topics in Operating Systems (HotOS ’19), May Despite their importance, failure detectors have tradition- 13–15, 2019, Bertinoro, Italy. ACM, New York, NY, USA,7 pages. ally been implemented as a thin module with simple logic https://doi.org/10.1145/3317550.3321440 independent of the underlying code: a monitored process is as- sumed to be working as long as it does something periodically Abstract based on the contract with the external detector, e.g., replies to pings, sends heartbeat messages, or maintains sessions. Systems software today is composed of numerous modules This works fine for fail-stop failures, but it cannot detect com- and exhibits complex failure modes. Existing failure detec- plex gray failures [23] including partial disk failures [31], tors focus on catching simple, complete failures and treat limplock [17], fail-slow hardware [11, 20], and state corrup- programs uniformly at the process level. In this paper, we ar- tion [16], which are common in large cloud infrastructure. gue that modern software needs intrinsic failure detectors that These failure detectors are overly generic, treating all mon- are tailored to individual systems and can detect anomalies itored software as coarse-grained “nodes”. The resulting fail- within a process at finer granularity. We particularly advo- ure modes are inherently too simple to represent the com- cate a notion of intrinsic software watchdogs and propose plex behavior of modern software. The recently proposed an abstraction for it. Among the different styles of watch- Panorama [22] attempts to address this limitation by convert- dogs, we believe watchdogs that imitate the main program ing any requester of a monitored process into a logical ob- can provide the best combination of completeness, accuracy server and captures error evidence in the request paths. While and localization for detecting gray failures. But, manually this approach can enhance failure detection, the observers constructing such mimic-type watchdogs is challenging and cannot identify why the failure occurs or isolate which part of time-consuming. To close this gap, we present an early explo- the failing process is problematic, making subsequent failure ration for automatically generating mimic-type watchdogs. diagnosis painful and time-consuming [4]. Hierarchical spies as proposed in Falcon [27] has similar limitations. 1 Introduction In this position paper, we argue that system software needs Software inevitably fails. In programs designed for interac- intrinsic failure detectors that detect anomalies within a pro- tive usage, a user can observe anomalies in the software and cess at finer granularity. An intrinsic detector monitors inter- react. For example, the user of a text editor may find that nally for subtle issues specific to a process, e.g., checking the backspace key can no long delete characters so she may if a Cassandra background task of SSTable compaction is restart the process and restore the last saved file. But a large stuck. Importantly, an intrinsic detector could pinpoint the fraction of software today is a component of some online problematic code region along with the payload for diagnos- service that demands high availability with minimal man- ing and reproducing production failures. This precise fault ual intervention [13, 29]. Such software needs to proactively information could further help expedite recovery. In particular, we advocate a promising yet under-explored watchdogs Permission to make digital or hard copies of all or part of this work for type of intrinsic failure detector – intrinsic – for personal or classroom use is granted without fee provided that copies are not system software. Watchdogs are widely used in embedded made or distributed for profit or commercial advantage and that copies bear devices such as deep space probes whose operation environ- this notice and the full citation on the first page. Copyrights for components ment can be remote and hostile due to extreme temperature, of this work owned by others than the author(s) must be honored. Abstracting high-intensity radiation, etc. They are hardware circuits con- with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request trolled by embedded software to automatically detect anom- permissions from [email protected]. alies within the system, and reset the processor or microcon- HotOS ’19, May 13–15, 2019, Bertinoro, Italy troller in response to failure. In the broader software domain, © 2019 Copyright held by the owner/author(s). Publication rights licensed to however, only a few mature systems have adopted the watch- ACM. dog concept [1]. Even for these systems, the watchdog mod- ACM ISBN 978-1-4503-6727-1/19/05. $15.00 ules are designed in a shallow way (e.g., to only periodically https://doi.org/10.1145/3317550.3321440 HotOS ’19, May 13–15, 2019, Bertinoro, Italy Chang Lou, Peng Huang, and Scott Smith Table 1. Comparison of three abstractions: crash failure detector, error handler and watchdog. Abstraction Scope Execution Goal Checks Target Analogy Crash FD Extrinsic Concurrent Inform another process about a process’s status to benefit a group Liveness Protocol failure Heartbeat Error handler Intrinsic In-place Mitigate a known error in a specific program point to prevent failure Safety Low-level error Immune sys. Watchdog Intrinsic Concurrent Monitor overall software health and assess if software is functioning Safety+Live. Partial failure Blood test check some status code), which are in fact equivalent to ex- use that information to adjust its behavior for e.g., consensus, trinsic detectors. It is unclear what a truly intrinsic software broadcasting, load balancing, or deciding a replica set. In watchdog should be like and how to systematically write it. comparison, the primary goal for a watchdog is to benefit To shed some light on this under-explored type of intrinsic the individual process it monitors, and a fault that does not failure detector, we propose a unique software watchdog ab- immediately concern the process group protocol may still be straction (§3.1), elucidate characteristics of a good watchdog of interest to a watchdog. Watchdogs and traditional failure (§3.2), and describe design principles for coding watchdogs detectors can and should co-exist. Watchdogs have better ac- (§3.3). Based on these design principles we believe that a cess to internal system states and thus will be particularly particularly effective type of watchdog is one that mimics the suitable for dealing with partial failures. Crash failure detec- main program. But manually writing such a watchdog is time- tors have stronger isolation. So if severe thrashing causes an consuming and challenging to get right as it needs to simulate entire process to become unresponsive and jeopardizes the the key interactions of the main program without negatively watchdogs as well, a crash detector can still catch the failure. impacting execution. To address this gap we present an early In contrast with the popularity of watchdogs in embedded exploration of how customized, mimic-type watchdogs can systems, mainstream software engineering does not put much be generated for a given piece of software (§4), and conclude emphasis on designing intrinsic watchdogs despite a similar with a discussion of challenges and future directions (§5). need for robustness. The primary way for system software to catch subtle failures today is to rely on error handlers or 2 Background and Motivation in-place assertions. Although error handlers do a good job of detecting some program-specific faults, they are designed as A Watchdog Timer (WDT) [12] is an essential component part of the main business logic, with the goal of mitigating found in embedded systems to detect and handle hardware some specific known error condition associated with a spe- faults or software errors. WDT’s use internal counters that cific program point for the program to continue execution. So start from an initial value and count down to zero. When the for example catching an EINTR error during a write system counter reaches zero, the watchdog resets the processor. In a call is the target of an error handler, and it may retry suc- multi-stage watchdog, it will initiate a series of actions upon cessfully. Watchdogs on the other hand are tasked to monitor timeout, such as generating an interrupt, activating fail-safe overall software health and give a definitive assessment as to states, logging debug information and resetting the processor. whether the software is still functioning properly. In addition, To prevent a reset, the software must keep “kicking” the complex failures such as metadata inconsistency and data in- watchdog, typically by writing to some control port. tegrity require complex checks beyond a single operation and To effectively use a watchdog, the program must do more are thus not suitable for error handlers. Watchdogs can run than just kick the watchdog at regular intervals – the software complex fsck-like checks in parallel to the normal execution should perform sanity checks [19], on e.g. the stack depth, to catch such failures. Liveness-related failures often also do program counter, resource usage, and status of the mechanical not have explicit error signals that can trigger a handler: there components before kicking the watchdog. It is also good is no signal for e.g., write being blocked indefinitely or some practice to insert a flag at each important point of the main thread deadlocking or infinitely looping.
Load more

Recommended publications
  • Failure Detectors for Wireless Sensor-Actuator Systems
    Cleveland State University EngagedScholarship@CSU Electrical Engineering & Computer Science Electrical Engineering & Computer Science Faculty Publications Department 7-2009 Failure Detectors for Wireless Sensor-Actuator Systems Hamza A. Zia Cleveland State University Nigamanth Sridhar Clevealand State University, [email protected] Shivakumar Sastry University of Akron Follow this and additional works at: https://engagedscholarship.csuohio.edu/enece_facpub Part of the Digital Communications and Networking Commons How does access to this work benefit ou?y Let us know! Publisher's Statement NOTICE: this is the author’s version of a work that was accepted for publication in Ad Hoc Networks. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Ad Hoc Networks, 7, 5, (07-01-2009); 10.1016/j.adhoc.2008.09.003 Original Citation Zia, H. A., Sridhar, N., , & Sastry, S. (2009). Failure detectors for wireless sensor-actuator systems. Ad Hoc Networks, 7(5), 1001-1013. doi:10.1016/j.adhoc.2008.09.003 Repository Citation Zia, Hamza A.; Sridhar, Nigamanth; and Sastry, Shivakumar, "Failure Detectors for Wireless Sensor-Actuator Systems" (2009). Electrical Engineering & Computer Science Faculty Publications. 64. https://engagedscholarship.csuohio.edu/enece_facpub/64 This Article is brought to you for free and open access by the Electrical Engineering & Computer Science Department at EngagedScholarship@CSU. It has been accepted for inclusion in Electrical Engineering & Computer Science Faculty Publications by an authorized administrator of EngagedScholarship@CSU.
    [Show full text]
  • The Dynamic Enterprise Bus∗
    Fourth International Conference on Autonomic and Autonomous Systems The Dynamic Enterprise Bus∗ Dag Johansen Havard˚ Johansen Dept. of Computer Science Dept. of Computer Science University of Tromsø, Norway University of Tromsø, Norway Abstract This is where autonomic computing [18] comes into play. Our goal is that information access software should In this paper we present a prototype enterprise informa- keep manual control and interventions outside the compu- tion run-time heavily inspired by the fundamental principles tational loop as much as possible. Closely related is that of autonomic computing. Through self-configuration, self- such autonomic solutions should consolidate and utilize re- optimization, and self-healing techniques, this run-time tar- sources better, with the net effect that large-scale informa- gets next-generation extreme scale information-access sys- tion access systems can be built in smaller scale. In this tems. We demonstrate these concepts in a processing cluster vein, self-configuration, self-optimization, and self-healing that allocates resources dynamically upon demand. become important. We are building the next generation run-time for fu- ture generation information access systems. Autonomic be- 1 Introduction havior is fundamental in order to dynamically adapt and reconfigure to accommodate changing situations. Hence, the run-time needs efficient mechanisms for monitoring Enterprise search systems are ripe for change. In their in- and controlling applications and their resource, moving ap- fancy, these systems were primarily used for information re- plications transparently while in execution, scheduling re- trieval purposes, with main data sources being internal cor- sources in accordance to end-to-end service-level agree- porate archives.
    [Show full text]
  • Low-Overhead Accrual Failure Detector
    Sensors 2012, 12, 5815-5823; doi:10.3390/s120505815 OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journal/sensors Article Low-Overhead Accrual Failure Detector Xiao Ren, Jian Dong *, Hongwei Liu, Yang Li and Xiaozong Yang School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China * Author to whom correspondence should be addressed; E-Mail: [email protected]; Tel.: +86-451-8640-3317; Fax: +86-451-8641-3309. Received: 6 March 2012; in revised form: 20 April 2012 / Accepted: 25 April 2012 / Published: 4 May 2012 Abstract: Failure detectors are one of the fundamental components for building a distributed system with high availability. In order to maintain the efficiency and scalability of failure detection in a complicated large-scale distributed system, accrual failure detectors that can adapt to multiple applications have been studied extensively. In this paper, an new accrual failure detector—LA-FD with low system overhead has been proposed specifically for current mobile network equipment on the Internet whose processing power, memory space and power supply are all constrained. It does not rely on the probability distribution of message transmission time, or on the maintenance of a history message window. By simple calculation, LA-FD provides adaptive failure detection service with high accuracy to multiple upper applications. The related experiments and results have also been presented. Keywords: failure detection; accrual failure detector; adaptive 1. Introduction Failure detector is one of the fundamental components for building a distributed system with high availability [1]. By providing the processes’ failure information to the system, it supports the solution of many basic issues (such as consensus and atomic broadcasting, etc.) in an asynchronous system.
    [Show full text]
  • A Literature Review of Failure Detection Within the Context of Solving the Problem of Distributed Consensus
    A literature review of failure detection Within the context of solving the problem of distributed consensus by Michael Duy-Nam Phan-Ba B.S., The University of Washington, 2010 AN ESSAY SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE in The Faculty of Graduate and Postdoctoral Studies (Computer Science) THE UNIVERSITY OF BRITISH COLUMBIA (Vancouver) April 2015 c Michael Duy-Nam Phan-Ba 2015 Abstract As modern data centers grow in both size and complexity, the probabil- ity that components fail becomes significant enough to affect user-facing services [3]. These failures have the apparent consequence of invoking the impossibility result for distributed consensus in the presence of even one failure [15]. One way to solve the impossibility result is to use failure de- tectors [8]. In this essay, we present the theoretical models that allow us to solve consensus. Then, we discuss practical refinements to the models for the purposes of implementing failure detectors in practice. Finally, we con- clude by surveying common design patterns for building distributed failure detectors. ii Table of Contents Abstract ................................. ii Table of Contents ............................ iii List of Tables .............................. v List of Figures .............................. vi List of Algorithms . vii Acknowledgements . viii Dedication ................................ ix 1 Introduction ............................. 1 2 The theory behind failure detection and consensus . 3 2.1 The impossibility result for consensus . 3 2.2 A model of failure detection . 4 2.3 The weakest failure detector . 7 3 Binary failure detection with partial synchrony . 13 3.1 Pull failure detection . 14 3.2 Push failure detection . 15 3.3 Push-pull failure detection .
    [Show full text]
  • Failure Detectors for Wireless Sensor-Actuator Systems Hamza A
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Cleveland-Marshall College of Law Cleveland State University EngagedScholarship@CSU Electrical Engineering & Computer Science Faculty Electrical Engineering & Computer Science Publications Department 7-2009 Failure Detectors for Wireless Sensor-Actuator Systems Hamza A. Zia Cleveland State University Nigamanth Sridhar Clevealand State University, [email protected] Shivakumar Sastry University of Akron Follow this and additional works at: https://engagedscholarship.csuohio.edu/enece_facpub Part of the Digital Communications and Networking Commons How does access to this work benefit oy u? Let us know! Publisher's Statement NOTICE: this is the author’s version of a work that was accepted for publication in Ad Hoc Networks. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Ad Hoc Networks, 7, 5, (07-01-2009); 10.1016/j.adhoc.2008.09.003 Original Citation Zia, H. A., Sridhar, N., , & Sastry, S. (2009). Failure detectors for wireless sensor-actuator systems. Ad Hoc Networks, 7(5), 1001-1013. doi:10.1016/j.adhoc.2008.09.003 Repository Citation Zia, Hamza A.; Sridhar, Nigamanth; and Sastry, Shivakumar, "Failure Detectors for Wireless Sensor-Actuator Systems" (2009). Electrical Engineering & Computer Science Faculty Publications. 64. https://engagedscholarship.csuohio.edu/enece_facpub/64 This Article is brought to you for free and open access by the Electrical Engineering & Computer Science Department at EngagedScholarship@CSU.
    [Show full text]
  • INFORMATION to USERS This Manuscript Has Been Reproduced from the Microfilm Master. UMI Films the Text Directly from the Origina
    INFORMATION TO USERS This manuscript has been reproduced from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer. Hie quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed through, substandard margins, and improper alignment can adversely afreet reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps. Each original is also photographed in one exposure and is included in reduced form at the back of the book. Photographs included in the original manuscript have been reproduced xerographically in this copy. Higher quality 6" x 9" black and white photographic prints are available for any photographs or illustrations appearing in this copy for an additional charge. Contact UMI directly to order. University Microfilms International A Ben & Howell information Company 300 North ZeebRoad Ann Arbor Mt 48106-1346 USA 313 761-4700 800 521-0600 Order Number 9605332 Fault-tolerant distributed algorithms for consensus and termination detection Wu, Li-Fen, Ph.D. The Ohio State University, 1994 UMI 300 N.
    [Show full text]
  • Self-Healing Distributed Systems
    ÃABCÊÇÅÍÆGËÀ¼ Self-healing distributed systems Dissertation for the degree of Doctor of Natural Sciences (Dr. rer. nat.) submitted to the Department of Computer Science of the University of Augsburg presented by Benjamin Satzger in 2008 Examiner: Prof. Dr. rer. nat. Theo Ungerer Co-examiner: Prof. Dr. rer. nat. Bernhard Bauer Date of oral examination: 2008-12-18 Abstract The growing complexity of distributed systems demands for new ways of control. This work addresses self-healing in distributed environments. The term self-healing represents a quite new area of research and is used in a fairly broad way, but can be seen as dynamic fault tolerance. This work proposes generic concepts and algorithms to build self-healing systems. The detection of node failures in distributed environments is a non-trivial problem. Failure detectors are an important component of many fault tol- erant distributed systems. In this work a new failure detection algorithm is proposed with noteworthy features like a high flexibility and good perfor- mance. Furthermore an approach is presented to save the message overhead of failure detectors. New grouping algorithms are introduced in this work to enable a scalable self-monitoring property. This allows an autonomous installation of moni- toring relations in complex large scale distributed systems. A failure recovery engine based on automated planning, which manages a distributed system according to user-defined objectives, is proposed. It is able to generate and execute plans to autonomously recover a system from unwanted states. Finally, ideas for a generic self-healing architecture for highly complex dis- tributed systems are presented. The design is based on psychological and sociological concepts.
    [Show full text]
  • A Self-Tuning Failure Detection Scheme for Cloud Computing Service
    2012 IEEE 26th International Parallel and Distributed Processing Symposium A Self-tuning Failure Detection Scheme for Cloud Computing Service Naixue Xiong Athanasios V. Vasilakos Jie Wu Dept. of Computer Science Dept. of Comp. and Tele. Engi. Dept. of Comp. and Info. Scie. Georgia State Univ., USA Univ. of Western Macedonia, Greece Temple Univ., USA. E-mail: {nxiong, wsong, pan}@gsu.edu E-mail: [email protected] E-mail: [email protected] Y. Richard Yang Andy Rindos Yuezhi Zhou1,Wen-Zhan Song2,Yi Pan2 Dept. of Computer Science IBM Corp., Dept. W4DA/Bldg 503 1Dept. of Comp. Scie. & Tech. Yale Univ. Research Triangle Park, Tsinghua Univ., China New Haven, USA Durham, NC, USA E-mail: [email protected] E-mail: [email protected] E-mail: [email protected] 2Dept. of Computer Science Georgia State Univ., USA E-mail: {wsong, pan}@cs.gsu.edu Abstract—Cloud computing is an increasingly important so- maintain high levels of Quality of Service (QoS) in accessing lution for providing services deployed in dynamically scalable information remotely in network environments, and should cloud networks. Services in the cloud computing networks may ensure users’ application security and dependability. be virtualized with specific servers which host abstracted details. In the cloud computing networks, some of the servers Some of the servers are active and available, while others are busy or heavy loaded, and the remaining are offline for various may be active and available, while others are busy or heavy reasons. Users would expect the right and available servers to loaded, and the remaining may be offline or even crashed complete their application requirements.
    [Show full text]
  • The Failure Detector Abstraction
    The Failure Detector Abstraction Felix C. Freiling, University of Mannheim and Rachid Guerraoui, EPFL and MIT CSAIL and Petr Kuznetsov, TU Berlin/Deutsche Telekom Laboratories A failure detector is a fundamental abstraction in distributed computing. This paper surveys this abstraction through two dimensions. First we study failure detectors as building blocks to simplify the design of reliable distributed algorithms. In particular, we illustrate how failure detectors can factor out timing assumptions to detect failures in distributed agreement algorithms. Second, we study failure detectors as computability benchmarks. That is, we survey the weakest failure detector question and illustrate how failure detectors can be used to classify problems. We also highlight some limitations of the failure detector abstraction along each of the dimensions. Categories and Subject Descriptors: A.1 [General Literature]: Introductory and Survey; C.4 [Computer Systems Organization]: Performance of Systems|fault tolerance; modeling tech- niques; reliability, availability, and serviceability General Terms: Algorithms, Design, Reliability, Theory Additional Key Words and Phrases: distributed system, agreement problem, consensus, atomic commit, fault tolerance, liveness, message passing, safety, synchrony The first author's work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Emmy Noether programme. Contact author's address: University of Mannheim, Department of Computer Science, D-68131 Mannheim, Germany, contact author email: [email protected] Permission to make digital/hard copy of all or part of this material without fee for personal or classroom use provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc.
    [Show full text]
  • AVR1003: Using the XMEGA Clock System
    AVR 8-bit Microcontrollers AVR1003: Using the XMEGA Clock System APPLICATION NOTE Features • Internal 32kHz, 2MHz, and 32MHz oscillators • External crystal oscillator or clock input • Internal PLL with multiplication factor 1x to 31x • Safe clock source switching • External oscillator failure detection • 1x to 2048x system clock prescaler option • Automatic runtime calibration of internal oscillators • Driver source code included Atmel-8072F-Using-the-XMEGA-Clock-System_AVR1003_Application Note-07/2016 Table of Contents Features.......................................................................................................................... 1 1. Introduction................................................................................................................3 2. Clock System Overview.............................................................................................4 2.1. Internal Clock Sources................................................................................................................. 4 2.2. External Clock Sources................................................................................................................ 5 2.3. High-frequency PLL Option.......................................................................................................... 7 2.4. System Clock Selection and Prescalers.......................................................................................7 2.5. Clock Configuration Locking.........................................................................................................8
    [Show full text]
  • Distributed Algorithms
    Master 2 IFI, CSSR Distributed Algorithms Francesco Bongiovanni INRIA Sophia Antipolis Research Center OASIS Team [email protected] Course web site : deptinfo.unice.fr/~baude/AlgoDist Nov. 2009 Chapter 7 : Failure Detectors, Consensus, Self-Stabilization 1 Acknowledgement . The slides for this lecture are based on ideas and materials from the following sources: . Introduction to Reliable Distributed Programming Guerraoui, Rachid, Rodrigues, Luís, 2006, 300 p., ISBN: 3-540-28845-7 (+ teaching material) . ID2203 Distributed Systems Advanced Course by Prof. Seif Haridi from KTH – Royal Institute of Technology (Sweden) . CS5410/514: Fault-tolerant Distributed Computer Systems Course by Prof. Ken Birman from Cornell University . Distributed Systems : An Algorithmic Approach by Sukumar, Ghosh, 2006, 424 p.,ISBN:1-584-88564-5 (+teaching material) . Various research papers 2 Outline 1. Failure Detectors . Definition . Properties – completeness and accuracy . Classes of FDs . Two algorithms : PFD and EPFD . Leader Election vs Failure Detector 2. Consensus . Definition . Properties . Types of Consensus : regular and uniform . Algorithm: hierarchical consensus 3. Self-stabilization . Principle . Example: Dijkstra's Token ring 3 Failure detectors 4 System models . synchronous distributed system . each message is received within bounded time . each step in a process takes lb < time < ub . each local clock’s drift has a known bound . asynchronous distributed system . no bounds on process execution . no bounds on message transmission delays . arbitrary clock drifts the Internet is an asynchronous distributed system 5 Failure model . First we must decide what do we mean by failure? . Different types of failures . Crash-stop (fail-stop) . A process halts and Crashes does not execute any further operations Omissions .
    [Show full text]
  • Failure Detectors Outline
    Department of Computer Science CS505: Distributed Systems Lecture 7: Failure Detectors Outline Definitions Failure detector classification and comparison An alternative definition Implementation Concept A failure detector is a distributed module that provides processes with suspicions about crashed processes – Outputs a list of suspected processes It is a module implemented using (i.e., it encapsulates) timing assumptions – Assumptions are confined within single module – Decisions throughout algorithm are based on same module . E.g., point-to-point channels, broadcast According to the timing assumptions, the suspicions can be accurate or not Example Applications indication request (deliver) indicationReliable broadcasts (deliver) (deliver) Failure detectorindication indication request(deliver) Channels request (deliver) Properties Traditionally [Chandra&Toueg’96] define two properties for failure detectors 1. Completeness . The degree to which failures (crashes) are indeed detected . Reflects liveness 2. Accuracy . The degree to which false suspicions are limited . Reflects safety Focus on process failures – No information on communication channels Formally Processes ∏ = {p1, p2, …} – Processes fail by halting Clock ticks range over Τ Failure pattern F is function Τ → 2∏ – Represents set of processes failed by time t – No recovery: F(t) ⊆ F(t+1) – crashed(F) = U t∈T F(t) – correct(F) = ∏ - crashed(F) Failure Detector D Failure detector history H is function ∏ x T → 2∏ – Outputs for each process a set of suspected processes – H(p, t)
    [Show full text]