The Community for Technology Leaders
Green Image
<p>This paper addresses the problems of state space decomposition and predicate detection in a distributed computation involving asynchronous messages. We introduce a natural communication dependency which leads to the definition of the communication graph. This abstraction proves to be a useful tool to decompose the state lattice of a distributed computation into simpler structures, known as concurrent intervals. Efficient algorithms have been proposed in the literature to detect special classes of predicates, such as conjunctive predicates and bounded sum predicates. We show that more general classes of predicates can be detected when proper constraints are imposed on the underlying computations. In particular, we introduce a class of predicates, defined herein as separable predicates, that properly includes the above-mentioned classes. We show that separable predicates can be efficiently detected on distributed computations whose communication graphs satisfy the series-parallel constraint.</p>
distributed computation, predicate detection, state lattice, concurrent interval, communication graph, series-parallel structure, separable predicate

G. Dumais and H. F. Li, "Distributed Predicate Detection in Series-Parallel Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 13, no. , pp. 373-387, 2002.
95 ms
(Ver 3.3 (11022016))