Filters








65,903 Hits in 4.1 sec

Consistent detection of global predicates

Robert Cooper, Keith Marzullo
1991 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging - PADD '91  
This paper presents three algorithms for detecting global predicates in a well-defined way.  ...  A fundamental problem in debugging and monitoring is detecting whether the state of a system satisfies some predicate.  ...  Acknowledgements We would like to acknowledge Gil Neiger, with whom we developed the protocols, and Raphael Yahalom who read an earlier draft of this paper.  ... 
doi:10.1145/122759.122774 dblp:conf/pdd/CooperM91 fatcat:4siblb62bjh5rjf6q6z7b2wmqu

Consistent detection of global predicates

Robert Cooper, Keith Marzullo
1991 SIGPLAN notices  
This paper presents three algorithms for detecting global predicates in a well-defined way.  ...  A fundamental problem in debugging and monitoring is detecting whether the state of a system satisfies some predicate.  ...  Acknowledgements We would like to acknowledge Gil Neiger, with whom we developed the protocols, and Raphael Yahalom who read an earlier draft of this paper.  ... 
doi:10.1145/127695.122774 fatcat:emlmf5jjynabxlmxaixoaaaaji

Detecting temporal logic predicates on the happened-before model

A. Sen, V. K. Garg
2002 Proceedings 16th International Parallel and Distributed Processing Symposium  
Detection of a global predicate is a fundamental problem in distributed computing. In this paper we describe new predicate detection algorithms for certain temporal logic predicates.  ...  We present solutions to the predicate detection of linear and observer-independent predicates under £ ¥ ¤ and ¦ § ¤ operators of CTL.  ...  This approach, instead of building the lattice of global states (global state space) for the distributed computation, directly uses the computation to detect if the predicate is satisfied in a global state  ... 
doi:10.1109/ipdps.2002.1015583 dblp:conf/ipps/SenG02 fatcat:326idkovgvbm3etxfjwj7dv3w4

Distributed algorithms and causally consistent observations (abstract) [chapter]

Friedemann Mattern
1995 Lecture Notes in Computer Science  
H o wever, if we simply deny the existence of global time, does it then still make sense to consider global predicates (i.e., predicates of the global state) of a distributed system?  ...  Such a realization of the so-called causal order message delivery property, howeve r , d o e s n o t s o l v e all conceptual problems with global predicates: If two or more causally consistent observers  ...  H o wever, if we simply deny the existence of global time, does it then still make sense to consider global predicates (i.e., predicates of the global state) of a distributed system?  ... 
doi:10.1007/3-540-60029-9_30 fatcat:j436qvm22rdx3oagmb2aekegpy

Efficient detection of restricted classes of global predicates [chapter]

Craig M. Chase, Vijay K. Garg
1995 Lecture Notes in Computer Science  
These properties generalize several known properties of distributed systems, such as the set of consistent cuts forms a lattice, and the WCP and GCP predicate dectection results given in earlier work.  ...  We show that the problem of predicate detection in distributed systems is NP-complete.  ...  We thank him for many valuable discussions and his insight into the importance of the linearity propery.  ... 
doi:10.1007/bfb0022155 fatcat:t7t376f74facnfkfbrpoa3ea5i

Detecting quantified global predicates in parallel programs [chapter]

Mark Minas
1995 Lecture Notes in Computer Science  
Efficient centralized and parallel algorithms for detecting satisfaction of 9-predicates are proposed.  ...  Global predicates in parallel programs are predicates considering the state of more than one process.  ...  Programs consist of fixed numbers of processes. 9-predicates As 9-predicates we consider a restricted class of global predicates: each 9-predicate, denoted 9P 1 ; P 2 , consists of two local predicates  ... 
doi:10.1007/bfb0020481 fatcat:xnl7cnm27ngy7lssascg3xjrm4

Intractability results in predicate detection

Sujatha Kashyap, Vijay K. Garg
2005 Information Processing Letters  
It has been shown that global predicate detection in a distributed computation is an NP-complete problem in general.  ...  However, polynomial-time predicate detection algorithms exist for some classes of predicates, such as stable predicates, observer-independent predicates, conjunctions of local predicates etc.  ...  We focus here on classes of predicates that satisfy certain properties with respect to the lattice of all consistent global states, C(S).  ... 
doi:10.1016/j.ipl.2005.02.008 fatcat:scy3kg57qrdwfgjkzedcthwbta

Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing [chapter]

Alper Sen, Vijay K. Garg
2004 Lecture Notes in Computer Science  
However predicate detection suffers from the state explosion problemthe number of possible global states of the program increases exponentially with the number of processes.  ...  Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distributed systems.  ...  The predicate detection problem is to decide whether the initial consistent cut of a distributed computation satisfies a predicate.  ... 
doi:10.1007/978-3-540-27860-3_17 fatcat:nwofuojchfgxrgtjbk3so2ingu

On Detection of Bounded Global Predicates

I.-C. Wu
1998 Computer journal  
In order to detect bounded global predicates, we can first derive the minimum and maximum global snapshots and then check if the minimum and maximum are out of the range.  ...  Distributed programs often follow some bounded global predicates, for example, the total number of certain tokens is always the same or bounded in a range.  ...  ACKNOWLEDGEMENTS The authors would like to thank the National Science Council of the Republic of China for financially supporting this research under contract No. NSC-83-0408-E-009-027.  ... 
doi:10.1093/comjnl/41.4.231 fatcat:wpsdoykccfhl7iapqlszv3hy7u

Optimistic Execution in Key-Value Store [article]

Duong Nguyen, Aleksey Charapko, Sandeep Kulkarni, Murat Demirbas
2018 arXiv   pre-print
We propose a detect-rollback based approach: The designer identifies a correctness predicate, say P , and continue to run the protocol, as our system monitors P .  ...  We also show that the overhead of the monitor itself is small (typically less than 8%) and the latency of detecting violations is very low.  ...  An algorithm for capturing consistent global snapshots and detecting stable predicates was proposed by Chandy and Lamport [25] .  ... 
arXiv:1801.07319v1 fatcat:4re2yjj2gzaxledlpbrwgokw7a

Technical Report: Optimistic Execution in Key-Value Store [article]

Duong Nguyen, Aleksey Charapko, Sandeep Kulkarni, Murat Demirbas
2018 arXiv   pre-print
In particular, more than 99.9% of violations are detected in less than 50 milliseconds in regional AWS networks, and in less than 5 seconds in global AWS networks.  ...  We propose a detect-rollback based approach: The designer identifies a correctness predicate, say P, and continues to run the protocol, as our system monitors P.  ...  For example, assume the global predicate of interest to be detected is ¬P ≡ ¬P 1 ∨ ¬P 2 · · · ∨ ¬P m where each ¬P j is a smaller global predicate.  ... 
arXiv:1805.11453v3 fatcat:kg75kgsoknbetd2twl5ekapp2e

Partial Order Trace Analyzer (POTA) for Distributed Programs

Alper Sen, Vijay K. Garg
2003 Electronical Notes in Theoretical Computer Science  
A slice of a computation (execution trace) with respect to a predicate is the computation with the least number of global states that contains all global states of the original computation for which the  ...  The advantage of this technique is that, it mitigates the state explosion problem by reasoning only on the part of the global state space that is of interest.  ...  Acknowledgements: We would like to acknowledge Neeraj Mittal for his contribution in the implementation of POTA. We also thank Gerard J. Holzmann for discussion on SPIN.  ... 
doi:10.1016/s1571-0661(04)81041-7 fatcat:lfg326gj3jggnergof6ggldpnu

A Harmony Search Based Algorithm for Detecting Distributed Predicates

Eslam Al
2012 International Journal of Advanced Computer Science and Applications  
Due to concurrency, the detection of distributed predicates can incur significant overhead.  ...  Detection of distributed predicates (also referred to as runtime verification) can be used to verify that a particular run of a given distributed program satisfies certain properties (represented as predicates  ...  As a result, the number of global tates that must be considered to detect a predicate will be exponential in number of processes.  ... 
doi:10.14569/ijacsa.2012.031025 fatcat:njf3gdbq2zfzzdlpjk2gzn572y

A parallel algorithm for global states enumeration in concurrent systems

Yen-Jung Chang, Vijay K. Garg
2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP 2015  
One important part of predicate detection is global states enumeration, which generates the global states on inferred paths.  ...  One of the verification methods is predicate detection, which predicts whether the user specified condition (predicate) could become true in any global states of the program.  ...  Predicate detection is a method that detects whether the user specified condition (predicate) could become true in any of the global states in an execution path of the program with a different thread schedule  ... 
doi:10.1145/2688500.2688520 dblp:conf/ppopp/ChangG15 fatcat:kgozmzjtujhizfpt5cxyxr35dy

Particle Swarm Optimization Algorithm for Detecting Distributed Predicates

Eslam Al Maghayreh, Habib Dhahiri, Fahad Albogamy, Mohamad Mahmoud Al Rahhal, Awais Mahmood, Esam Othman, Wail S. Elkilani
2021 IEEE Access  
The problem of distributed predicates detection, in general, is known to be an NP-complete problem.  ...  We compared the performance of the proposed distributed predicates detection algorithm with several other detection algorithms.  ...  The only way to detect it is to go through the global states of the run until we find a global state satisfying the predicate.  ... 
doi:10.1109/access.2021.3097182 fatcat:lkdsw347abftnoxsfm2ynypmrq
« Previous Showing results 1 — 15 out of 65,903 results