On detecting global predicates in distributed computations

DMCA

On detecting global predicates in distributed computations (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Neeraj Mittal

Venue:	In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems (ICDCS
Citations:	23 - 10 self

BibTeX

@INPROCEEDINGS{Mittal01ondetecting,
    author = {Neeraj Mittal},
    title = {On detecting global predicates in distributed computations},
    booktitle = {In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems (ICDCS},
    year = {2001},
    pages = {3--10},
    publisher = {IEEE}
}

OpenURL

Abstract

Monitoring of global predicates is a fundamental problem in asynchronous distributed systems. This problem arises in various contexts such as design, testing and debugging, and fault-tolerance of distributed programs. In this paper, we establish that the problem of determining whether there exists a consistent cut of a computation that satisfies a predicate in ¡-CNF, ¡£¢¥ ¤ , in which no two clauses contain variables from the same process is NP-complete in general. A polynomial-time algorithm to find the consistent cut, if it exists, that satisfies the predicate for special cases is provided. We also give algorithms albeit exponential that can be used to achieve an exponential reduction in time over existing techniques for solving the general version. Furthermore, we present an algorithm to determine whether there exists a consistent cut of a computation for which the ¦¨§�©�¦��©��©�¦� � sum exactly equals some con-stant ¡, where each ¦� � is an integer variable on process �¨� such that it is incremented or decremented by at most one at each step. As a corollary, any symmetric global predicate on boolean variables such as absence of simple majority and exclusive-or of local predicates can now be detected. Additionally, the problem is proved to be NP-complete if each ¦� � can be changed by an arbitrary amount at each step. Our results solve the previously open problems in predicate detection proposed in [7] and bridge the wide gap between the known tractability and intractability results that existed until now. 1.

Keyphrases

global predicate consistent cut distributed computation symmetric global predicate general version boolean variable wide gap predicate detection local predicate fundamental problem asynchronous distributed system simple majority exponential reduction polynomial-time algorithm arbitrary amount open problem distributed program various context special case intractability result integer variable

DMCA