An investigation of membership and clique avoidance in TTP/C

Author

Bauer, Gunther ; Paulitsch, Michael

Author_Institution

Real Time Syst. Group, Wien Univ. of Technol., Austria

fYear

2000

fDate

2000

Firstpage

118

Lastpage

124

Abstract

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

Keywords

distributed processing; software performance evaluation; time division multiple access; transport protocols; TDMA; TTP/C protocol; algorithm performance; clique avoidance algorithm; cluster partitioning; implicit acknowledgement algorithm; membership; time-division multiple access scheme; time-triggered communication protocol; Algorithm design and analysis; Clustering algorithms; Fault tolerant systems; Frequency synchronization; Jitter; Partitioning algorithms; Protocols; Real time systems; Scheduling; Time division multiple access;

fLanguage

English

Publisher

ieee

Conference_Titel

Reliable Distributed Systems, 2000. SRDS-2000. Proceedings The 19th IEEE Symposium on

Conference_Location

Nurnberg

Print_ISBN

0-7695-0543-0

Type

conf

DOI

10.1109/RELDI.2000.885399

Filename

885399