Browsing by Author "CHANG, HK"

Now showing 1 - 8 of 8

AVAILABILITY OF K-COTERIE - COMMENTS
(1994-12-01)
YUAN, SM
;
CHANG, HK
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
Kakugawa ef al, proposed the k-majority coterie for the distributed k-mutual exclusion problem (k-mutex). It was claimed that the K-majority coterie is a k-coterie, which is a general solution for k-mutex. In this comment, we show that the k-majority coterie is not necessary a k-coterie.
BANDWIDTH OF CROSSBARS FOR GENERAL REFERENCE MODEL
(1993-10-14)
CHANG, HK
;
YUAN, SM
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
The bandwidth of crossbar multiprocessor systems is analysed for the general memory reference model. Previous solutions are restricted to several specified models: uniform memory reference, favorite memory reference and hot-spot; the presented analysis includes these as special cases.
EFFICIENT ALGORITHM FOR EVALUATING THE AVAILABILITY OF MULTIDIMENSIONAL VOTING
(1994-01-01)
CHANG, HK
;
YUAN, SM
;
資訊工程學系
;
Department of Computer Science
Voting is a fault-tolerant technique to synchronize conflict operations on shared resources in a faulty distributed system. Multidimensional voting is a generalization of traditional weighted voting. The availability of a voting system is determined by the vote and quorum assignments. In this paper, we present an O(n(k)+1) efficient algorithm for evaluating the availability of any given k-multidimensional vote and quorum assignments, where n is the number of sites in the system and k is the number of dimensions.
HIGHLY NONLINEAR-INTERACTIONS BETWEEN A GRAVITY-WAVE AND A CURRENT OF CONSTANT VORTICITY
(1995-03-01)
CHANG, HK
;
HO, LS
;
土木工程學系
;
Department of Civil Engineering
The Fourier series method is employed to calculate particle velocity, wavelength and wave profile of a gravity wave propagating on a vertically varying linear shear current. From the comparisons between predicted values and experimental data, it is found that highly nonlinear interaction resulting from a shear current has significant effects on the wave field, and that the lower order wave theories give poor prediction. For waves of the same height and period, the shear current causes a change in wavelength and wave profile. An adverse shear current shortens wavelength; contrarily wavelength is enlarged by a favourable current. The wave crest is steepened and the trough becomes flat when the wave and favourable shear current are moving in the same direction. The wave surface profile becomes more asymmetrical about the mean water level when a favourable current exists.
MESSAGE COMPLEXITY OF HIERARCHICAL QUORUM CONSENSUS ALGORITHM
(1994-04-22)
CHANG, HK
;
YUAN, SM
;
資訊工程學系
;
Department of Computer Science
The hierarchical quorum consensus (HQC) algorithm, which is a generalization of the standard quorum consensus algorithm for managing replicated data, can reduce the quorum size to N0.63. This paper analyzes the message complexity of HQC. Moreover, an asymptotic analysis on the ratio of the message complexity to the quorum size is presented. It is shown that the ratio converges to a constant.
MESSAGE COMPLEXITY OF THE TREE QUORUM ALGORITHM
(1995-08-01)
YUAN, SM
;
CHANG, HK
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
The tree quorum algorithm (TQA) uses a tree structure to generate intersecting (tree) quorums for distributed mutual exclusion, This paper analyzes the number of messages required to acquire a quorum in TQA. Let i be the depth of the complete binary tree used in TQA, and let M(i) be the number of messages required to acquire a quorum or to determine that no quorum is accessible. We discuss M(i) as a function of i and p, where p (1/2 < p < 1) is the probability that each site is operational. Let C-i denote the average number of sites in the quorum that TQA finds. The analysis shows that, although both M(i) and C-i increase without bound as i increases, M(i)/C-i approaches to 1+p/p as i increases. According to the result, an approximate close form for M(i) is derived.
MESSAGE COMPLEXITY OF THE TREE QUORUM ALGORITHM FOR DISTRIBUTED MUTUAL EXCLUSION
(1994)
CHANG, HK
;
YUAN, SM
;
資訊工程學系
;
Department of Computer Science
PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM
(1995-06-01)
CHANG, HK
;
YUAN, SM
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
The tree quorum algorithm, which logically organizes the sites in a system to a tree structure, is an efficient and fault-tolerant solution for distributed mutual exclusion. In this paper, the performance characteristics of the tree quorum algorithm is analyzed. A refinement algorithm is proposed to refine a logical tree structure by eliminating nodes or subtrees which do not improve the peformance. Thus the refined tree performs better than the original.