PERFORMANCE CHARACTERIZATION OF THE TREE QUORUM ALGORITHM

被引：4

作者：

CHANG, HK

YUAN, SM

机构：

[1] Department of Computer and Information Science, National Chiao Tung University, Hsinchu

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1995年 / 6卷 / 06期

关键词：

DISTRIBUTED MUTUAL EXCLUSION; TREE QUORUM ALGORITHM; AVAILABILITY; COMMUNICATION COST;

D O I：

10.1109/71.388047

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：658 / 662

页数：5

共 11 条

[1] AN EFFICIENT AND FAULT-TOLERANT SOLUTION FOR DISTRIBUTED MUTUAL EXCLUSION [J].

AGRAWAL, D ;

ELABBADI, A .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1991, 9 (01) :1-20

[2] HOW TO ASSIGN VOTES IN A DISTRIBUTED SYSTEM [J].

GARCIAMOLINA, H ;

BARBARA, D .

JOURNAL OF THE ACM, 1985, 32 (04) :841-860

[3] A THEORY OF COTERIES - MUTUAL EXCLUSION IN DISTRIBUTED SYSTEMS [J].

IBARAKI, T ;

KAMEDA, T .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (07) :779-794

[4] A SQUARE-ROOT-N ALGORITHM FOR MUTUAL EXCLUSION IN DECENTRALIZED SYSTEMS [J].

MAEKAWA, M .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1985, 3 (02) :145-159

[5]

NELISEN ML, 1992, IEEE T PARALL DISTR, V3, P582

[6]

Raynal M., 1991, Operating Systems Review, V25, P47, DOI 10.1145/122120.122123

[7]

Raynal M., 1986, ALGORITHMS MUTUAL EX

[8]

RICART G, 1987, COMMUN ACM, V5, P284

[9]

SANDERS BA, 1981, ACM T COMPUT SYST, V24, P9

[10]

SUZUKI I, 1987, ACM T COMPUT SYST, V5, P284

← 1 2 →