[PDF] Top 20 GENERAL REDUCTION METHODS FOR THE RELIABILITY-ANALYSIS OF DISTRIBUTED COMPUTING SYSTEMS

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

... counting the accepting computations for problems in NP; the class of #P-complete problems contains the hardest problems in ...algorithms for these problems have exponential time ... See full document

... network reliability/Ke and Wang) which em- ploys a different concept that requires one step to give the reliability ...expression. The basic idea of the ENR/KW algorithm is to ... 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

... 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

... 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

... JS. The complexityof reliabilitycomputations in planar and acyclic ...on Computing 1986;15:694}702. [15] Sheppard DA. Standard for banking communication ...evaluation of distributed ... 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 ...Because ... See full document

... For the KTR problem, polynomial-time (or linear-time) algorithms have been developed for other restricted networks, such as a star network, a 2-tree network, and a series-parallel network ...copy ... See full document

... 4. Computing DPR for a DCS with a tree topology is ...problem for a DCS with a star topology, in general, is ...problem for a DCS with a tree topology, in general, is also ... 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

... Because we apply straightforward heuristic rules, our algorithm generates fewer disjoint terms t h a n tra- ditional reliability indexes such as source to multiterm[r] ... See full document

... no available links can be cut, or the subgraph does not contain the required data files for executing the distributed program. For example, Fig. 5 depicts one of the terminat[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

... Thus, we intend to assign modules to the best-fit processor as well as determine the best transmission sequence in order to obtain the minimum or a near-minimum[r] ... See full document

... In this paper, we develop a heuristic algorithm for the reliability-oriented file assignment prob- lem (HROFA), which uses a careful reduction method to reduce the p[r] ... See full document

... of Computer Science and Information Engineering; Na- tional Chiao Tung University; Hsincbu 30050 TAIWAN - R.O. Internet (e-mail): jswu@algol .csie.nctu.edu[r] ... See full document

... In distributed computing environments, executing a program often requires the ac- cess of remote data ...important for time- critical ...scheme, the multipath routing, which ... See full document

... that the distributed heterogeneous computing system has different features, the considerations of exploiting the computing resource in the homogeneous ... See full document