General Reduction Methods for the Reliability Analysis of Distributed Computing Systems | Zendy

Mingxiang Lin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

General Reduction Methods for the Reliability Analysis of Distributed Computing Systems

Author(s) -

Mingxiang Lin

Publication year - 1993

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/36.7.631

Subject(s) - computer science , reduction (mathematics) , reliability (semiconductor) , reliability engineering , distributed computing , mathematics , engineering , power (physics) , physics , geometry , quantum mechanics

The reliability of a distributed computing system is the probability that a distributed program which runs on multiple processing elements and needs to communicate with other processing elements for remote data files will be executed successfully. This reliability varies according to (1) the topology of the distributed computing system, (2) the reliability of the communication links, (3) the data files and program distribution among processing elements, and (4) the data files required to execute a program. Thus, the problem of analyzing the reliability of a distributed computing system is more complicated than the K-terminal reliability problem, and many of the reliability-preserving reductions for speeding up the computation of the K-terminal reliability cannot be applied to this problem

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research