Date of Publication

8-1992

Document Type

Master's Thesis

Degree Name

Master of Science in Computer Science

Subject Categories

Computer Sciences | Digital Communications and Networking

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

En-Hsin Huang

Defense Panel Chair

Kelsey Hartigan Y. Go

Defense Panel Member

Mitch Andaya
Peter Fernandez

Abstract/Summary

Reliability of distributed systems can be examined in terms of the reliability of the processing elements and communication links and also of the redundancy of jobs and data files the traditional terminal pair reliability does not capture the redundancy of jobs and data files in a distributed system. This study will focus on the evaluation of distributed job reliability using fuzzy sets. Distributed job reliability (DJR) is the probability that a given job can run successfully in spite of some failures occurring among the processing elements and the communication links.

A conceptual model with algorithms for computing the reliability of a distributed job will be presented. The algorithms generate shortest resource subgraphs (SRSs) which satisfy the distributed job execution cost constraint. This constraint will limit the number of shortest resource subgraphs.

This paper presents a graph theoretic model that is used in formal analysis. This study will focus on evaluating distributed job reliability using the fuzzy set theory approach. Formal proof of correctness of algorithms is conducted.

Abstract Format

html

Language

English

Format

Print

Accession Number

TG02073

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

122 leaves, 28 cm.

Keywords

Electronic data processing--Distributed processing; Electronic digital computers--Reliability; Set theory; Algorithms; Graph theory; Distributed computer systems in electronic data processing

Upload Full Text

wf_yes

Download

Share

COinS