Skip to main navigation Skip to search Skip to main content

Availability of a distributed computer system with failures

  • Erol Gelenbe
  • , David Finkel
  • , Satish K. Tripathi
    • Université Paris-Saclay
    • Bucknell University

    Research output: Contribution to journal › Article › peer-review

    43 Scopus citations

    Abstract

    A model for distributed systems with failing components is presented. Each node may fail and during its recovery the load is distributed to other nodes that are up. The model assumes periodic checkpointing for error recovery and testing of the status of other nodes for the distribution of load. We consider the availability of a node, which is the proportion of time a node is available for processing, as the performance measure. A methodology for optimizing the availability of a node with respect to the checkpointing and testing intervals is given. A decomposition approach that uses the steady-state flow balance condition to estimate the load at a node is proposed. Numerical examples are presented to demonstrate the usefulness of the technique. For the case in which all nodes are identical, closed form solutions are obtained.

    Original languageEnglish
    Pages (from-to)643-655
    Number of pages13
    JournalActa Informatica
    Volume23
    Issue number6
    DOIs
    StatePublished - Nov 1986

    Fingerprint

    Dive into the research topics of 'Availability of a distributed computer system with failures'. Together they form a unique fingerprint.

    Cite this