Browsing by Author "CHEN, RS"

Now showing 1 - 4 of 4

A HEURISTIC ALGORITHM FOR THE RELIABILITY-ORIENTED FILE ASSIGNMENT IN A DISTRIBUTED COMPUTING SYSTEM
(1995-05-01)
CHEN, DJ
;
HOL, WC
;
CHEN, RS
;
CHEN, DTK
;
資訊科學與工程研究所
Distributed Computing Systems (DCS) have become a major trend in today's computer system design because of their high speed and high reliability. Reliability is an important performance parameter in DCS design. Usually, designers add redundant copies of software and/or hardware to increase the system's reliability. Thus, the distribution of data files can affect the program reliability and system reliability. The reliability-oriented file assignment problem is to find a file distribution such that the program reliability or system reliability is maximized. In this paper, we develop a heuristic algorithm for the reliability-oriented file assignment problem (HROFA), which uses a careful reduction method to reduce the problem space. Our numerical results indicate that the HROFA algorithm obtains the exact solution in most cases and the computation time is significantly shorter than that needed for an exact method. When HROFA fails to give an exact solution, the derivation from the exact solution is very small.
A NEW APPROACH TO DESIGN AND IMPLEMENTATION OF IBM PC FOR ACCESSING LIBRARY CD-ROM DATABASE VIA CAMPUS NETWORK
(1993)
CHEN, RS
;
CHEN, DJ
;
YEH, YS
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
A NEW HEURISTIC APPROACH FOR RELIABILITY OPTIMIZATION OF DISTRIBUTED COMPUTING SYSTEMS SUBJECT TO CAPACITY CONSTRAINTS
(1995-02-01)
CHEN, RS
;
CHEN, DJ
;
YEH, YS
;
交大名義發表
;
資訊科學與工程研究所
Distributed Computing Systems (DCS) have become a major trend in computer system design today, because of their high speed and reliable performance. Reliability is an important performance parameter in DCS design. In the reliability analysis of a DCS, the term of K-Node Reliability (KNR) is defined as the probability that all nodes in K (a subset of all processing elements) are connected. In this paper, we propose a simple, easily programmed heuristic method for obtaining the optimal design of a DCS in terms of maximizing reliability subject to a capacity constraint. The first part of this paper presents a heuristic algorithm which selects an optimal set of K-nodes that maximizes the KNR in a DCS subject to the capacity constraint. The second part of the paper describes a new approach that uses a K-tree disjoint reduction method to speed up the KNR evaluation. Compared with existing algorithms on various DCS topologies, the proposed algorithm finds a suboptimal design much more efficiently in terms of both execution time and space than an exact and exhaustive method for a large DCS.
RELIABILITY OPTIMIZATION OF DISTRIBUTED COMPUTING SYSTEMS SUBJECT TO CAPACITY CONSTRAINTS
(1995-02-01)
CHEN, RS
;
CHEN, DJ
;
YEH, YS
;
交大名義發表
;
資訊科學與工程研究所
In this paper, we propose a simple, easily programmed exact method for obtaining the optimal design of a distributed computing system in terms of maximizing reliability subject to memory capacity constraints. We assume that a given amount of resources are available for linking the distributed computing system. The method is based on the partial order relation. To speed up the procedure, some rules are proposed to indicate conditions under which certain vectors in the numerical ordering that do not satisfy the capacity constraints can be skipped over. Simulation results show that the proposed algorithm requires less time and space than exhaustive method.