An investigation of membership and clique avoidance in TTP/C

被引：17

作者：

Bauer, G ^{[1
]}

Paulitsch, M ^{[1
]}

机构：

[1] Vienna Univ Technol, Real Time Syst Grp, A-1040 Vienna, Austria

来源：

19TH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS - PROCEEDINGS | 2000年

关键词：

D O I：

10.1109/RELDI.2000.885399

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Avoiding the partitioning of a cluster into cliques that are not able to communicate with each other is an important issue in the time-triggered communication protocol TTP/C. This is achieved by a mechanism called Clique Avoidance. The Clique Avoidance algorithm always selects one partition (clique) to win and causes all nodes of other partitions to shut down. In this paper; we are going to investigate the properties of this algorithm by analyzing its performance, elaborating the properties, and showing how the Clique Avoidance algorithm interacts with the Implicit Acknowledgement algorithm of TTP/C.

引用

页码：118 / 124

页数：7

共 10 条

[1] Synchronous and asynchronous group communication [J].

Cristian, F .

COMMUNICATIONS OF THE ACM, 1996, 39 (04) :88-97

[2] The timed asynchronous distributed system model [J].

Cristian, F ;

Fetzer, C .

TWENTY-EIGHTH ANNUAL INTERNATIONAL SYMPOSIUM ON FAULT-TOLERANT COMPUTING, DIGEST PAPERS, 1998, :140-149

[3]

Katz S, 1997, LECT NOTES COMPUT SC, V1320, P155, DOI 10.1007/BFb0030682

[4] TTP - A PROTOCOL FOR FAULT-TOLERANT REAL-TIME SYSTEMS [J].

KOPETZ, H ;

GRUNSTEIDL, G .

COMPUTER, 1994, 27 (01) :14-23

[5]

KOPETZ H, 1999, TTP C PROTOCOL

[6]

KOPETZ H, 1989, DEPENDABLE COMPUTING, P411

[7]

Kopetz H., 1997, REAL TIME SYSTEMS DE

[8]

Laprie J. C. C., 1992, Dependability: Basic Concepts and Terminology-In English, French,German, Italian and Japanese

[9]

PFEIFER H, 2000, IFIP TC6 WG6 1 INT C

[10]

POWELL D, 1992, P 22 INT S FAULT TOL, P386, DOI DOI 10.1109/FTCS.1992.243562

← 1 →