[PDF] Top 20 The reliability analysis of distributed computing systems with imperfect nodes

... Department of Mathematics Education, National Taipei Teacher College, Taipei, Taiwan 10659, Republic of China Email: [email protected] The reliability of a distributed ... See full document

... counting the accepting computations for problems in NP; the class of #P-complete problems contains the hardest problems in ...class of DCS's. In light of above discussion, this ... See full document

... at National Chiao Tung University Library on April 28, 2014.. http://comjnl.oxfordjournals.org/.[r] ... See full document

... In this correspondence, we propose an algorithm, called the Fast Reliability Evaluation Algorithm (FREA), based on the generalized factoring theorem by employing several[r] ... See full document

... The HRFST algorithm reduces both the number of subgraphs (or trees) generated and the actual execution time required for the reliability analysis of DPR and DSR.. Our study of va[r] ... See full document

... 3. The CLK algorithm Finding FSTs and using MFSTs to compute the DPR by the disjoint method in the previous works is difficult when the DCS network becomes large and ...on the ... See full document

... Huang, Reliability analysis of distributed systems based on a fast reliability algorithm, IEEE Trans.. Lin, On distributed computing systems.[r] ... See full document

... on the price-performance revolution in ...use of workstations connected in the form of a powerful distributed computing ...such distributed computing systems ... See full document

... [14] Provan JS. The complexityof reliabilitycomputations in planar and acyclic graphs. SIAM Journal on Computing 1986;15:694}702. [15] Sheppard DA. Standard for banking communication system. IEEE ... See full document

... Distributed Computing Systems 95 we are to find a set of X-nodes from the given set N which constitutes an optimal DCS in t h a t X-node reliability is maximized[r] ... See full document

... A distributed computing system is a collection of processor–memory pairs connected by communication ...subset of total nodes in a distributed computing ...set with ... See full document

... on the multipath routing scheme, the problem of optimal routing can be described as a multicommodity ¯ow problem if the number of paths in a source±destination session is unlimited and ... See full document

... for the reliability analysis of a multi-state system subject to imperfect fault-coverage with combinatorial performance ...apply the Multi-state Dependency Operation (MDO) ... See full document

... amount of work has been devoted to developing algorithms to compute measures of reliability for a ...typical reliability measure for a DCS is the K-terminal reliability (KTR) ... See full document

... communicating with others no mater where they ...set of various files such that the optimal reliability of a star DCS with given the reliability of communi- ... See full document

... set reliability with capacity constraint is de®ned as the probability that a set, K, of nodes is connected in a distributed system and the total capacity of ... See full document

... D with n + 1 nodes s , v 1 , v 2 , … , v n and file distributions A i , 1 ≤ i ≤ ...π(n)] of numbers {1, 2, … , n} such that if file f d ∈ A π(i) and f d ∈ A π(j) , then f d ∈ A π(k) for all k, π(i) < ... See full document

... to reliability evaluation of time- constrained distributed ...in the previous section, three steps must be performed before the TCDPR can be ...computed. The first step is to ... See full document

... [36] The BDD Library ...Dean of the College of Electrical and Computer Engineering, National Taiwan University of Science and Technology, Taipei, ...at the Department of ... See full document

... test of an enterprise security management system with advanced internal security’’ by Seoksoo Kim et ...management systems and, on the basis of the results, proposes and tests an ... See full document