Distributed algorithm to detect strong conjunctive predicates

DOI10.1016/S0020-0190(03)00295-3MaRDI QIDQ1014431zbMATH OpenOpenAlexFDO

Authors Punit Chandra, Ajay D. Kshemkalyani

Publication date 28 April 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(03)00295-3

zbMATH Keywords

causalitydistributed computingpredicate detectionglobal state

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Repeated detection of conjunctive predicates in distributed executions
• Detecting conjunctions of global predicates
• Detection of global predicates: techniques and their limitations
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Distributed Computing - IWDC 2003

Cites work

• scientific article; zbMATH DE number 1955840 (Why is no real title available?)
• On interprocess communication. I: Basic formalism
• Temporal interactions of intervals in distributed systems.
• Time, clocks, and the ordering of events in a distributed system

Cited in

(8)

• Maximal antichain lattice algorithms for distributed computations
• Distributed reasoning for restricted weakly-linear disjunctive tuple-generating dependencies
• On Detecting Regular Predicates in Distributed Systems
• Detecting conjunctions of global predicates
• scientific article; zbMATH DE number 1955840 (Why is no real title available?)
• Repeated detection of conjunctive predicates in distributed executions
• Data-stream-based global event monitoring using pairwise interactions
• Efficient online algorithm for identifying useless states in distributed systems

This page was built for publication: Distributed algorithm to detect strong conjunctive predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014431)