Testing of synchronization conditions for distributed real-time applications

Abstract

A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specification of causality relations and synchronization conditions. For a pair of distributed nonatomic events X and Y, the evaluation of the synchronization relations requires [Nx|×|NYl integer comparisons, where INxl and INYI, respectively, are the number of nodes on which the two nonatomic events X and Y occur. In this paper, we show that this polynomial complexity of evaluation can by simplified using properties of partial orders to a linear complexity. Specifically, we show that most relations can be evaluated in min(|Nx|, |NY |) integer comparisons, some in |Nx| integer comparisons, and the others in |Nv| integer comparisons. These linear time evaluation conditions enable the real-time applications to detect the relations efficiently.