Intractability results in predicate detection |
| |
Authors: | Sujatha Kashyap Vijay K Garg |
| |
Affiliation: | Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX 78712, USA |
| |
Abstract: | It has been shown that global predicate detection in a distributed computation is an NP-complete problem in general. However, efficient predicate detection algorithms exist for some subclasses of predicates, such as stable predicates, observer-independent predicates, conjunctions of local predicates, channel predicates, etc. We show here that the problem of deciding whether a given predicate is a member of any of these tractable subclasses is NP-hard in general.We also explore the tractability of linear and regular predicates. In particular, we show that, unless RP=NP, there is no polynomial-time algorithm to detect for linear and regular predicates B. |
| |
Keywords: | Distributed computing Computational complexity Predicate detection Distributed debugging |
本文献已被 ScienceDirect 等数据库收录! |
|